自己脑洞的并查集，求解#2 #9 #10RE

#include<bits/stdc++.h>
using namespace std;
int n,m;
int num1,num2;
int flag;
map<int,int>fa;
int getfa(int a){return !fa.count(a)||fa[a]==a?fa[a]=a:fa[a]=getfa(fa[a]);}
bool equal(int a,int b){return getfa(a)==getfa(b);}
void uni(int a,int b){fa[getfa(a)]=getfa(b);}
int main()
{
    scanf("%d%d",&n,&m);
    while(m--){
        scanf("%d%d%d",&flag,&num1,&num2);
        if(flag==1)
            uni(num1,num2);        
        else
            printf(equal(num1,num2)?"Y\n":"N\n");
    }
    return 0;
}