Submission #11593291
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; int INF = 100000; typedef pair<int,int> P; class UnionFind{ vector<int> par; vector<int> rank; public: UnionFind(int N){ for (int i = 0;i < N;i++) par.push_back(i),rank.push_back(1); } int find(int x){ if (par[x] == x) return x; else return par[x] == find(par[x]); } void unite(int x,int y){ x = find(x); y = find(y); if (x == y) return; if (rank[x] < rank[y]) par[x] = y; else { par[y] = x; if (rank[x] == rank[y]) rank[x]++; } } bool same(int x,int y){ return find(x) == find(y); } }; int main() { int N,Q;cin >> N >> Q; UnionFind uf(N); for (int i = 0;i < Q;i++){ int p,a,b;cin >> p >> a >> b; if (p == 0){ uf.unite(a,b); } else{ if (uf.same(a,b)) cout << "Yes" << endl; else cout << "No" << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | guitarist |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1073 Byte |
Status | RE |
Exec Time | 566 ms |
Memory | 263668 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 | 272 ms | 768 KB |
subtask_01_02.txt | AC | 2 ms | 1276 KB |
subtask_01_03.txt | AC | 415 ms | 1024 KB |
subtask_01_04.txt | AC | 460 ms | 1780 KB |
subtask_01_05.txt | AC | 25 ms | 256 KB |
subtask_01_06.txt | WA | 26 ms | 1276 KB |
subtask_01_07.txt | AC | 428 ms | 896 KB |
subtask_01_08.txt | AC | 455 ms | 1780 KB |
subtask_01_09.txt | AC | 1 ms | 256 KB |
subtask_01_10.txt | AC | 2 ms | 1276 KB |
subtask_01_11.txt | AC | 413 ms | 896 KB |
subtask_01_12.txt | AC | 495 ms | 1780 KB |
subtask_01_13.txt | AC | 356 ms | 768 KB |
subtask_01_14.txt | AC | 3 ms | 1276 KB |
subtask_01_15.txt | AC | 429 ms | 896 KB |
subtask_01_16.txt | AC | 456 ms | 1780 KB |
subtask_01_17.txt | RE | 566 ms | 263668 KB |
subtask_01_18.txt | WA | 310 ms | 1524 KB |