Submission #423147
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <iomanip> #include <vector> using namespace std; struct UnionFind { int data[200001]; bool unionSet(int x, int y) { x = root(x); y = root(y); if (x != y) { if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x; } return x != y; } bool findSet(int x, int y) { return root(x) == root(y); } int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); } int size(int x) { return -data[root(x)]; } }; int main() { int N, Q; int P, A, B; UnionFind uf; cin >> N >> Q; for (int i = 0; i < Q; ++i) { cin >> P >> A >> B; if (P == 0) { uf.unionSet(A, B); } if (P == 1) { if (uf.findSet(A, B)) { cout << "Yes" << endl; }else { cout << "No" << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | otomarukanta |
Language | C++ (GCC 4.9.2) |
Score | 0 |
Code Size | 932 Byte |
Status | RE |
Exec Time | 871 ms |
Memory | 255984 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 | RE | 861 ms | 255960 KB |
subtask_01_01.txt | RE | 857 ms | 255912 KB |
subtask_01_02.txt | RE | 857 ms | 255904 KB |
subtask_01_03.txt | RE | 865 ms | 255912 KB |
subtask_01_04.txt | RE | 809 ms | 255984 KB |
subtask_01_05.txt | RE | 857 ms | 255900 KB |
subtask_01_06.txt | RE | 856 ms | 255912 KB |
subtask_01_07.txt | RE | 864 ms | 255908 KB |
subtask_01_08.txt | RE | 871 ms | 255908 KB |
subtask_01_09.txt | RE | 865 ms | 255904 KB |
subtask_01_10.txt | RE | 864 ms | 255908 KB |
subtask_01_11.txt | RE | 864 ms | 255904 KB |
subtask_01_12.txt | RE | 859 ms | 255904 KB |
subtask_01_13.txt | RE | 867 ms | 255900 KB |
subtask_01_14.txt | RE | 870 ms | 255912 KB |
subtask_01_15.txt | RE | 864 ms | 255912 KB |
subtask_01_16.txt | RE | 865 ms | 255960 KB |
subtask_01_17.txt | RE | 822 ms | 255916 KB |
subtask_01_18.txt | RE | 801 ms | 255908 KB |