Submission #420851
Source Code Expand
#include <iostream> #include <string> using std::string; struct State { int n; int *par; }; int root(State &st, int x) { if (st.par[x] == x) { return x; } else { return st.par[x] = root(st, st.par[x]); } } bool same(State &st, int x, int y) { return root(st, x) == root(st, y); } void unite(State &st, int x, int y) { x = root(st, x); y = root(st, y); if (x == y) return; st.par[x] = y; } int main() { State st; int q; std::cin >> st.n >> q; st.par = new int[st.n]; for (int i = 0; i < st.n; i++) { st.par[i] = i; } for (int i = 0; i < q; ++i) { int p, a, b; std::cin >> p >> a >> b; if (p == 0) { unite(st, a, b); } else { if (same(st, a, b)) { std::cout << "Yes" << std::endl; } else { std::cout << "No" << std::endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | lambdataro |
Language | C++11 (GCC 4.9.2) |
Score | 100 |
Code Size | 1069 Byte |
Status | AC |
Exec Time | 910 ms |
Memory | 1312 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 | 27 ms | 804 KB |
subtask_01_01.txt | AC | 526 ms | 936 KB |
subtask_01_02.txt | AC | 27 ms | 1304 KB |
subtask_01_03.txt | AC | 725 ms | 836 KB |
subtask_01_04.txt | AC | 806 ms | 1180 KB |
subtask_01_05.txt | AC | 71 ms | 808 KB |
subtask_01_06.txt | AC | 72 ms | 1196 KB |
subtask_01_07.txt | AC | 701 ms | 760 KB |
subtask_01_08.txt | AC | 819 ms | 1180 KB |
subtask_01_09.txt | AC | 25 ms | 928 KB |
subtask_01_10.txt | AC | 27 ms | 1184 KB |
subtask_01_11.txt | AC | 738 ms | 920 KB |
subtask_01_12.txt | AC | 910 ms | 1312 KB |
subtask_01_13.txt | AC | 652 ms | 924 KB |
subtask_01_14.txt | AC | 29 ms | 1192 KB |
subtask_01_15.txt | AC | 876 ms | 804 KB |
subtask_01_16.txt | AC | 827 ms | 1192 KB |
subtask_01_17.txt | AC | 695 ms | 1200 KB |
subtask_01_18.txt | AC | 628 ms | 1180 KB |