luogu P3367 【模板】并查集

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cctype>
#include<cstdlib>
#include<string>
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<vector>
#define enter puts("")
#define space putchar(‘ ‘)
using namespace std;
typedef long long ll;
ll read()
{
    ll op = 1, ans = 0;
    char ch = getchar();
    while(ch < ‘0‘ || ch > ‘9‘)
    {
        if(ch == ‘-‘) op = 0;
        ch = getchar();
    }
    while(ch >= ‘0‘ && ch <= ‘9‘)
    {
        ans *= 10;
        ans += ch - ‘0‘;
        ch = getchar();
    }
    return op ? ans : -ans;
}
void write(ll x)
{
    if(x < 0)
    {
        x = -x;
        putchar(‘-‘);
    }
    if(x >= 10) write(x / 10);
    putchar(x % 10 + ‘0‘);
}
ll fa[10005], n, m;
ll find(ll x)
{
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}
int main()
{
    n = read(), m = read();
    for(int i = 1;i <= n;i++) fa[i] = i;
    for(int i = 1;i <= m;i++)
    {
        ll a, b, c;
        a = read(), b = read(), c = read();
        if(a == 1)
        {
            int sb = find(b), lj = find(c);
            if(sb != lj) fa[lj] = sb;
        }
        else
        {
            if(find(c) == find(b)) putchar(‘Y‘), enter;
            else putchar(‘N‘), enter;
        }
    }
    return 0;
}