Submission #7570503
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define ll long long #define vvi vector< vector<int> > #define vi vector<int> #define All(X) X.begin(),X.end() #define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define REP(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define pii pair<int,int> #define mp make_pair #define shosu(X) fixed << setprecision(X) ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} int n,q; int parent[100001]; int getroot(int p){ // if(p == parent[p]) return p; if(parent[p] < 0) return p; else return parent[p] = getroot(parent[p]); } void unite(int a, int b){ int x = getroot(a); int y = getroot(b); if (x == y) return; if (x > y) { swap(x, y); } if(x != y) parent[y] = x; } bool issame(int a, int b){ return (getroot(a) == getroot(b)); } int main(){ cin >> n >> q; REP(i, 100001) parent[i] = -1; REP(i, q){ int p, a, b; cin >> p >> a >> b; // a--; // b--; if(p == 0) unite(a, b); else cout << (issame(a, b) ? "Yes" : "No") << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | lp6m |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1107 Byte |
Status | AC |
Exec Time | 521 ms |
Memory | 1408 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 | 1 ms | 640 KB |
subtask_01_01.txt | AC | 297 ms | 1024 KB |
subtask_01_02.txt | AC | 1 ms | 640 KB |
subtask_01_03.txt | AC | 436 ms | 1408 KB |
subtask_01_04.txt | AC | 521 ms | 1280 KB |
subtask_01_05.txt | AC | 26 ms | 640 KB |
subtask_01_06.txt | AC | 28 ms | 640 KB |
subtask_01_07.txt | AC | 462 ms | 1152 KB |
subtask_01_08.txt | AC | 518 ms | 1152 KB |
subtask_01_09.txt | AC | 1 ms | 640 KB |
subtask_01_10.txt | AC | 1 ms | 640 KB |
subtask_01_11.txt | AC | 440 ms | 1280 KB |
subtask_01_12.txt | AC | 504 ms | 1280 KB |
subtask_01_13.txt | AC | 390 ms | 1152 KB |
subtask_01_14.txt | AC | 2 ms | 640 KB |
subtask_01_15.txt | AC | 450 ms | 1280 KB |
subtask_01_16.txt | AC | 511 ms | 1152 KB |
subtask_01_17.txt | AC | 347 ms | 896 KB |
subtask_01_18.txt | AC | 342 ms | 896 KB |