Code：
#include<iostream> #include<cstring> #include<string> #include<algorithm> #include<cstdlib> #include<cstdio> using namespace std; int n,m,bz; int father[200001]; int find(int x) { if(x==father[x]) return x; return father[x]=find(father[x]); } void unnio(int x,int y) { father[y]=x; } inline int read() { bool f=0; int x=0; char c=getchar(); while(c<'0'||c>'9') { if(c=='-') f=!f; c=getchar(); } while(c>='0'&&c<='9') { x=x*10+c-'0'; c=getchar(); } return f?-x:x; } inline void write(int x) { if(x<0) { putchar('-'); write(-x); } else { if(x/10) write(x/10); putchar(x%10+'0'); } } int main() { n=read(); m=read(); for(int i=1; i<=n; ++i) father[i]=i; int x,y; for(int i=1; i<=m; ++i) { bz=read(); x=read(); y=read(); if(bz==1) { int bz1=find(x); int bz2=find(y); if(bz1!=bz2) unnio(bz1,bz2); } else { if(find(x)==find(y)) printf("Y\n"); else printf("N\n"); } } return 0; }