原题链接
代码:
#include<iostream>
using namespace std;
int n,m;
int fa[100000];
int find(int x)
{
if(x!=fa[x])fa[x]=find(fa[x]);
return fa[x];
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)fa[i]=i;
for(int i=1;i<=m;i++)
{
int x,y,z;
cin>>z>>x>>y;
if(z==1)
{
int r1=find(x);
int r2=find(y);
if(r1!=r2)fa[r1]=r2;
}
else
{
if(find(x)==find(y))
{
cout<<"Y"<<endl;
}
else
cout<<"N"<<endl;
}
}
}