Submission #420203
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
template<int um> class UF {
public:
vector<int> par,rank,cnt;
UF() {rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par.push_back(i);}
int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
int count(int x) { return cnt[operator[](x)];}
int operator()(int x,int y) {
if((x=operator[](x))==(y=operator[](y))) return x;
cnt[y]=cnt[x]=cnt[x]+cnt[y];
if(rank[x]>rank[y]) return par[x]=y;
rank[x]+=rank[x]==rank[y]; return par[y]=x;
}
};
UF<500000> uf;
int N,Q;
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N>>Q;
while(Q--) {
cin>>i>>x>>y;
if(i==0) uf(x,y);
else {
if(uf[x]==uf[y]) _P("Yes\n");
else _P("No\n");
}
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
B - Union Find |
User |
kmjp |
Language |
C++ (GCC 4.9.2) |
Score |
100 |
Code Size |
1401 Byte |
Status |
AC |
Exec Time |
173 ms |
Memory |
9604 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 |
50 ms |
9600 KB |
subtask_01_01.txt |
AC |
104 ms |
9596 KB |
subtask_01_02.txt |
AC |
51 ms |
9600 KB |
subtask_01_03.txt |
AC |
171 ms |
9596 KB |
subtask_01_04.txt |
AC |
152 ms |
9592 KB |
subtask_01_05.txt |
AC |
57 ms |
9596 KB |
subtask_01_06.txt |
AC |
56 ms |
9600 KB |
subtask_01_07.txt |
AC |
154 ms |
9540 KB |
subtask_01_08.txt |
AC |
153 ms |
9600 KB |
subtask_01_09.txt |
AC |
49 ms |
9600 KB |
subtask_01_10.txt |
AC |
50 ms |
9604 KB |
subtask_01_11.txt |
AC |
152 ms |
9604 KB |
subtask_01_12.txt |
AC |
161 ms |
9604 KB |
subtask_01_13.txt |
AC |
128 ms |
9584 KB |
subtask_01_14.txt |
AC |
49 ms |
9600 KB |
subtask_01_15.txt |
AC |
173 ms |
9596 KB |
subtask_01_16.txt |
AC |
156 ms |
9592 KB |
subtask_01_17.txt |
AC |
147 ms |
9596 KB |
subtask_01_18.txt |
AC |
144 ms |
9592 KB |