模板题

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,m,f[N];
int find(int x){//找爹
    if(f[x]==x)return x;
    return f[x]=find(f[x]);
}
void merge(int x,int y){//合并
    x=find(x);
    y=find(y);
    f[x]=y;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)f[i]=i;
    while(m--){
        int z,x,y;
        cin>>z>>x>>y;
        if(z==1){
            if(find(x)!=find(y))merge(x,y);
        }
        else{
            if(find(x)==find(y))cout<<"Y"<<endl;
            else cout<<"N"<<endl;
        }
    }
    return 0;
}