P3367 【模板】并查集

#include<iostream>
using namespace std;
int b[10010];

int find(int n) 
{
    if (b[n] == n) return n;
    return b[n] = find(b[n]);
}
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) b[i] = i;
    int p1, p2, p3;
    for (int i = 1; i <= m; i++) 
    {
        cin >> p1 >> p2 >> p3;
        if (p1 == 1) b[find(p2)] = find(p3);
        else if (find(p2) == find(p3)) cout << "Y" << endl;
        else cout << "N" << endl;
    }
}