模板 并查集

//Writer:jr HSZ;%%%WJMZBMR
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define f(i,a,b) for(register int i=a;i<=b;i++)
#define MX 10005
using namespace std;
int n,m;
int fa[MX];
int find(int x) {
if(x==fa[x])return x;
else return fa[x]=find(fa[x]);
}
int main() {
int a,b,c;
scanf("%d%d",&n,&m);
f(i,1,n)fa[i]=i;
f(i,1,m) {
scanf("%d%d%d",&a,&b,&c);
if(a==1){
fa[find(b)]=find(c);//让他们找到祖先

}
if(a==2){
if(fa[find(b)]==fa[find(c)])cout<<'Y'<<endl;//判断一下
else cout<<'N'<<endl;
}
}
return 0;
}