纯模板 题解 100% AC

#include <bits/stdc++.h>
using namespace std;
int fa[200005],n,m;
int find(int x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
void join(int x,int y){fa[find(y)]=fa[find(x)];}
void init(){for(int i=1;i<=n;i++)fa[i]=i;}
int main(){
    cin>>n>>m;
    init();
    while(m--){
        int z,x,y;
        cin>>z>>x>>y;
        if(z==1)join(x,y);
        else if(find(x)==find(y))cout<<'Y'<<endl;
        else cout<<'N'<<endl;
    }
    return 0;
}