洛谷P3367 【模板】并查集

#include <iostream>

using namespace std;

int s[1000001];
int find(int x)
{
    if (x == s[x]) return x;
    s[x] = find(s[x]);
    return s[x];
}

int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++)
        s[i] = i;
    for (int i = 0; i < m; i++)
    {
        int x, y, z;
        cin >> z >> x >> y;
        if(z == 1)
        {
            x = find(x);
            y = find(y);
            s[x] = s[y];
        }
        if (z == 2)
        {
            if (find(x) == find(y))
                cout << "Y" << endl;
            else cout << "N" << endl;
        }
    }
    return 0;
}