Submission #423267

---

Source Code Expand

#include<iostream>

using namespace std;

int par[100000];
int ran[100000];

void init(int n){
	for(int i=0;i<n;i++){
		par[i]=i;
		ran[i]=0;
	}
}

int root(int x){
	return par[x] == x?x:par[x]=root(par[x]);
}

bool same(int x,int y){
	return root(x)==root(y);
}
void unite(int x,int y){
	x=root(x);
	y=root(y);
	if(x==y) return;
	
	if(ran[x]<ran[y]){
		par[x]=y;
	}
	else{
		par[y]=x;
		if(ran[x]==ran[y])
		ran[x]++;
	}
	
	}


int main(){
	
	int N,Q;
	
	cin>>N>>Q;
	init(N);
	while(Q!=0){
		int P,A,B;
		cin>>P>>A>>B;
		
		if(P==0)
			unite(A,B);
		else{
		if(same(A,B))
			cout<<"Yes"<<endl;
		else
			cout<<"No"<<endl;
		}
		
	}
	
}

Submission Info

Judge Result