Submission #1697164
Source Code Expand
#include "bits/stdc++.h" #define rep(i,n) for(int i=0;i<n;i++) #define ALL(v) (v).begin(),(v).end() typedef long long LL; const int INF = 1 << 25; const LL MOD = 1000000007LL; using namespace std; typedef pair<int, int> P; struct UnionFind { int *par; int *rank; UnionFind(int n) { par = new int[n]; rank = new int[n]; rep(i, n) { par[i] = i; rank[i] = 0; } } int find(int x) { if (x == par[x]) return x; return par[x] = find(par[x]); } bool same(int x, int y) { return find(x) == find(y); } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (rank[x] < rank[y]) { par[x] = y; } else { par[y] = x; if (rank[x] == rank[y]) rank[x]++; } } }; int main() { int N, K, L; cin >> N >> K >> L; UnionFind road(N), rail(N); rep(i, K) { int p, q; cin >> p >> q; p--; q--; road.unite(p, q); } rep(i, L) { int r, s; cin >> r >> s; r--; s--; rail.unite(r, s); } map<P, int> cnt; rep(i, N) { cnt[P(road.find(i), rail.find(i))]++; } rep(i, N) { if (i > 0) cout << " "; cout << cnt[P(road.find(i), rail.find(i))]; } cout << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Connectivity |
User | Div9851 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1191 Byte |
Status | AC |
Exec Time | 210 ms |
Memory | 15104 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 1 ms | 256 KB |
subtask0_1.txt | AC | 1 ms | 256 KB |
subtask0_2.txt | AC | 1 ms | 256 KB |
subtask1_0.txt | AC | 85 ms | 256 KB |
subtask1_1.txt | AC | 210 ms | 15104 KB |
subtask1_10.txt | AC | 88 ms | 256 KB |
subtask1_11.txt | AC | 196 ms | 13440 KB |
subtask1_12.txt | AC | 145 ms | 12928 KB |
subtask1_13.txt | AC | 157 ms | 14208 KB |
subtask1_14.txt | AC | 168 ms | 9984 KB |
subtask1_2.txt | AC | 128 ms | 9856 KB |
subtask1_3.txt | AC | 162 ms | 14080 KB |
subtask1_4.txt | AC | 170 ms | 11008 KB |
subtask1_5.txt | AC | 92 ms | 256 KB |
subtask1_6.txt | AC | 187 ms | 12672 KB |
subtask1_7.txt | AC | 149 ms | 14208 KB |
subtask1_8.txt | AC | 177 ms | 14208 KB |
subtask1_9.txt | AC | 158 ms | 7424 KB |