Submission #5486426
Source Code Expand
#include<bits/stdc++.h> using namespace std; const int MAX_N = 200005; int N; int Q; int p[MAX_N]; int a[MAX_N]; int b[MAX_N]; int par[MAX_N]; //親 int tree_rank[MAX_N]; //木の深さ //n要素で初期化 void init(int n) { for (int i = 0; i < n; i++) { par[i] = i; tree_rank[i] = 0; } } //木の根を求める int find(int x) { if (par[x] == x) { return x; } else { return par[x] = find(par[x]); } } //xとyに属する集合を併合 void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; if (tree_rank[x] < tree_rank[y]) { par[x] = y; } else { par[y] = x; if (tree_rank[x] == tree_rank[y]) tree_rank[x]++; } } //xとyが同じ集合に属するか判定 bool same(int x, int y) { return find(x) == find(y); } int main() { cin >> N >> Q; for (int i = 0; i < Q; i++) cin >> p[i] >> a[i] >> b[i]; init(Q); for (int i = 0; i < Q; i++) { if (p[i] == 0) { unite(a[i], b[i]); } if (p[i] == 1) { bool frag = same(a[i], b[i]); if (frag) cout << "Yes" << endl; else cout << "No" << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | fuminiton |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1195 Byte |
Status | WA |
Exec Time | 474 ms |
Memory | 4992 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_sample_01.txt |
All | 00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 1 ms | 256 KB |
subtask_01_01.txt | AC | 274 ms | 2944 KB |
subtask_01_02.txt | WA | 1 ms | 256 KB |
subtask_01_03.txt | AC | 396 ms | 4992 KB |
subtask_01_04.txt | AC | 473 ms | 4736 KB |
subtask_01_05.txt | AC | 25 ms | 640 KB |
subtask_01_06.txt | WA | 28 ms | 896 KB |
subtask_01_07.txt | AC | 429 ms | 4736 KB |
subtask_01_08.txt | AC | 474 ms | 4736 KB |
subtask_01_09.txt | AC | 1 ms | 256 KB |
subtask_01_10.txt | WA | 1 ms | 512 KB |
subtask_01_11.txt | AC | 414 ms | 4736 KB |
subtask_01_12.txt | AC | 474 ms | 4736 KB |
subtask_01_13.txt | AC | 356 ms | 3840 KB |
subtask_01_14.txt | WA | 2 ms | 640 KB |
subtask_01_15.txt | AC | 415 ms | 4736 KB |
subtask_01_16.txt | AC | 473 ms | 4736 KB |
subtask_01_17.txt | AC | 331 ms | 4480 KB |
subtask_01_18.txt | AC | 329 ms | 4480 KB |