Submission #420657
Source Code Expand
#include <iostream> #include <vector> using namespace std; int find(vector<int>& v, int c){ if(v[c] != c){ v[c] = find(v, v[c]); } return v[c]; } void unite(vector<int>& v, int a, int b){ int ca = find(v, a); int cb = find(v, b); if(ca != cb) v[ca] = cb; } vector<int> init(int n){ vector<int> v(n); for(int i = 0; i < n; i++){ v[i] = i; } return v; } int main(){ int n, q; cin >> n >> q; vector<int> v = init(n); for(int i = 0; i < q; i++){ int p, a, b; cin >> p >> a >> b; cerr << p << " : " << a << " : " << b << endl; if(p == 0){ unite(v, a, b); }else{ if(find(v, a) == find(v, b)){ cout << "Yes" << endl; }else{ cout << "No" << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | machy |
Language | C++ (GCC 4.9.2) |
Score | 100 |
Code Size | 916 Byte |
Status | AC |
Exec Time | 3023 ms |
Memory | 1304 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 | 26 ms | 716 KB |
subtask_01_01.txt | AC | 1826 ms | 804 KB |
subtask_01_02.txt | AC | 29 ms | 1184 KB |
subtask_01_03.txt | AC | 2776 ms | 844 KB |
subtask_01_04.txt | AC | 2706 ms | 1176 KB |
subtask_01_05.txt | AC | 235 ms | 924 KB |
subtask_01_06.txt | AC | 203 ms | 1176 KB |
subtask_01_07.txt | AC | 2918 ms | 928 KB |
subtask_01_08.txt | AC | 2918 ms | 1304 KB |
subtask_01_09.txt | AC | 27 ms | 804 KB |
subtask_01_10.txt | AC | 26 ms | 1300 KB |
subtask_01_11.txt | AC | 2681 ms | 920 KB |
subtask_01_12.txt | AC | 2809 ms | 1304 KB |
subtask_01_13.txt | AC | 2109 ms | 924 KB |
subtask_01_14.txt | AC | 34 ms | 1184 KB |
subtask_01_15.txt | AC | 2666 ms | 800 KB |
subtask_01_16.txt | AC | 3023 ms | 1304 KB |
subtask_01_17.txt | AC | 2676 ms | 1192 KB |
subtask_01_18.txt | AC | 2603 ms | 1300 KB |