Submission #3049395
Source Code Expand
#include <iostream> #include <string> #include <stack> #include <queue> #include <vector> #include <algorithm> #include <list> #include <set> #include <map> using namespace std; #define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0])) static const int MAX = 10000; int uni[MAX]; void init(int N){ for(int i = 0;i < N;i++){ uni[i] = -1; } } int root(int a){ if(uni[a] < 0) return a; else return uni[a] = root(uni[a]); } bool same(int a,int b){ return root(a) == root(b); } bool connect(int a,int b){ a = root(a); b = root(b); if(a == b) return false; if(uni[a] > uni[b]) swap(a,b); uni[a] += uni[b]; uni[b] = a; return true; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,Q; cin >> N >> Q; init(N); for(int i = 0;i < Q;i++){ int P,A,B; cin >> P >> A >> B; if(P == 0){ connect(A,B); }else{ if(same(A,B)) cout << "Yes" << endl; else cout << "No" << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | tsutarou10 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1022 Byte |
Status | RE |
Exec Time | 337 ms |
Memory | 1024 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 | 210 ms | 640 KB |
subtask_01_02.txt | RE | 98 ms | 256 KB |
subtask_01_03.txt | AC | 331 ms | 1024 KB |
subtask_01_04.txt | RE | 97 ms | 256 KB |
subtask_01_05.txt | AC | 19 ms | 256 KB |
subtask_01_06.txt | RE | 96 ms | 256 KB |
subtask_01_07.txt | AC | 337 ms | 896 KB |
subtask_01_08.txt | RE | 97 ms | 256 KB |
subtask_01_09.txt | AC | 1 ms | 256 KB |
subtask_01_10.txt | RE | 98 ms | 256 KB |
subtask_01_11.txt | AC | 330 ms | 896 KB |
subtask_01_12.txt | RE | 96 ms | 256 KB |
subtask_01_13.txt | AC | 279 ms | 768 KB |
subtask_01_14.txt | RE | 97 ms | 256 KB |
subtask_01_15.txt | AC | 331 ms | 896 KB |
subtask_01_16.txt | RE | 97 ms | 256 KB |
subtask_01_17.txt | RE | 97 ms | 256 KB |
subtask_01_18.txt | RE | 97 ms | 256 KB |