Submission #4084236
Source Code Expand
#include "bits/stdc++.h" using namespace std; struct UnionFind { //number of parents(par[i] = i => root) vector<int> par; //rank of tree vector<int> rank; UnionFind(int n) : par(n), rank(n, 1) { //initialize for(int i = 0; i < n; i++) par[i] = i; } //find root (keiroasshuku at the same time) int root(int x) { if (par[x] == x) return x; else return par[x] = root(par[x]); } //unite void unite(int x, int y) { x = root(x); y = root(y); if (x == y) return; if (rank[x] > rank[y]) swap(x, y); par[x] = y; if (rank[x] == rank[y]) rank[y]++; } //same tree? bool same(int x, int y) { return root(x) == root(y); } }; void solve() { int N, Q; cin >> N >> Q; UnionFind uf(N); while (Q--) { int p, a, b; cin >> p >> a >> b; if (p) { cout << (uf.same(a, b) ? "Yes" : "No") << endl; } else { uf.unite(a, b); } } } int main(void) { solve(); //cout << "yui(*-v・)yui" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | sifi_border |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1043 Byte |
Status | AC |
Exec Time | 465 ms |
Memory | 1664 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 297 ms | 640 KB |
subtask_01_02.txt | AC | 2 ms | 1024 KB |
subtask_01_03.txt | AC | 415 ms | 1024 KB |
subtask_01_04.txt | AC | 461 ms | 1664 KB |
subtask_01_05.txt | AC | 24 ms | 256 KB |
subtask_01_06.txt | AC | 26 ms | 1024 KB |
subtask_01_07.txt | AC | 426 ms | 768 KB |
subtask_01_08.txt | AC | 465 ms | 1664 KB |
subtask_01_09.txt | AC | 1 ms | 256 KB |
subtask_01_10.txt | AC | 2 ms | 1024 KB |
subtask_01_11.txt | AC | 410 ms | 896 KB |
subtask_01_12.txt | AC | 458 ms | 1664 KB |
subtask_01_13.txt | AC | 350 ms | 768 KB |
subtask_01_14.txt | AC | 3 ms | 1024 KB |
subtask_01_15.txt | AC | 428 ms | 768 KB |
subtask_01_16.txt | AC | 462 ms | 1664 KB |
subtask_01_17.txt | AC | 311 ms | 1408 KB |
subtask_01_18.txt | AC | 308 ms | 1408 KB |