Submission #420566

---

Source Code Expand

#include <iostream>
using namespace std;
#define MAX 100000
int parent[MAX];
int n;

int findparent(int cur){
	if(parent[cur]==cur)	return cur;
	else{
		parent[cur]=findparent(parent[cur]);
		return parent[cur];
	}
}

void connect(int a,int b){
	a=findparent(a);
	b=findparent(b);
	parent[b]=a;
}

bool judge(int a,int b){
	if(findparent(a)==findparent(b))	return true;
	else return false;
}

int main(){
	int q;
	cin>>n>>q;
	for(int i=0;i<n;i++)	parent[i]=i;
	int p,a,b;
	for(int i=0;i<q;i++){
		cin>>p>>a>>b;
		if(p==0)	connect(a,b);
		else{
			if(judge(a,b))	cout<<"Yes"<<endl;
			else 	cout<<"No"<<endl;
		}
	}
	return 0;
}

Submission Info

Judge Result