luogu 3367

并查集模板，习惯并查集都加路径压缩优化。

#include"cstdio"
#include"cctype"
int read()
{
    int c,x=0; while(!isdigit(c=getchar()));
    while(x=x*10+c-'0',isdigit(c=getchar()));
    return x;
}
int fa[10001];
int find(int x)
{
    return x==fa[x]? x:fa[x]=find(fa[x]);
}
int main()
{
    int n=read(),m=read();
    for(int i=1; i<=n; i++) fa[i]=i;
    while(m--)
    {
        int t=read();
        if(t==1) fa[find(read())]=find(read());
        else puts(find(read())==find(read())? "Y":"N");
    }
    return 0;
}