P3367 【模板】并查集

P3367 【模板】并查集

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e4+5;
int pa[maxn], n, m;
void init() {
    for (int i = 1; i <= n; i++) pa[i] = i;
}
int findset(int x) {
    return pa[x] != x ? pa[x] = findset(pa[x]) : x;
}
void merge(int x, int y) {
    int fx = findset(x);
    int fy = findset(y);
    if (fx == fy) return;
    pa[fx] = fy;
}
int main() {
    scanf("%d%d",&n,&m);
    init();
    while (m--) {
        int z, x, y; scanf("%d%d%d",&z,&x,&y);
        if (z == 1) merge(x,y);
        else {
            if (findset(x) == findset(y)) puts("Y");
            else puts("N");
        }
    }
    return 0;
}