Submission #6780369

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int m,n,i,x,y,q;
int fa[200001];
int find(int x)//集 
{
	if(fa[x]!=x) fa[x]=find(fa[x]);
	return fa[x];
}
void lianhe(int p1,int p2){fa[p2]=p1;}//并 
int main()
{	
    int p1,p2,d;
	cin>>n>>m;
	for(i=1;i<=n;i++) fa[i]=i;
	for(i=1;i<=m;i++)
	{
		cin>>d>>x>>y;
		if(d==0)
		{
			p1=find(x);p2=find(y);
		if(p1!=p2) lianhe(p1,p2);	
		}
		if(d==1)
		{
		if(find(x)==find(y))cout<<"Yes\n";//查 
		else cout<<"No\n";	
		}
	}
	return 0;
}

Submission Info

Judge Result