并查集

#include <iostream>
#include <stdio.h>
#define MAX 10005
using namespace std;
int father[MAX];
void init(int n) {
    for(int i=1;i<=n;i++) father[i] = i;
}
int FindFather(int x) {
    while(x != father[x]) x = father[x];
    return x;
}
void unionn(int x,int y) {
    int a = FindFather(x);
    int b = FindFather(y);
    if(a != b) father[a] = b;
}
bool judge(int x,int y) {
    int a = FindFather(x);
    int b = FindFather(y);
    if(a != b) return false;
    return true;
}

int main() {
    int n,m; cin>>n>>m;
    init(n);
    while(m--) {
        int p,x,y; scanf("%d%d%d",&p,&x,&y);
        if(p==1) unionn(x,y);
        else {
            if(judge(x,y)) printf("Y\n");
            else           printf("N\n");
        }
    }
    return 0;
}