题解

#include<iostream>
using namespace std;
int n,m,fa[200010];
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)];
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        fa[i]=i;
    }
    for(int i=0;i<m;i++){
        int z,s,y;
        cin>>z>>s>>y;
        if(z==1){
            join(s,y);
        }else{
            if(find(s)==find(y)){
                cout<<"Y\n";
            }else{
                cout<<"N\n";
            }
        }
    }
    return 0;
}