Cod sursa(job #3313146)

Utilizator calinarulMarinescu Calin calinarul Data 2 octombrie 2025 16:32:00
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int NMAX=1e5+5;
int t[NMAX], sz[NMAX];
int rad(int x){if(x!=t[x])t[x]=rad(t[x]);return t[x];}
void un(int x,int y)
{
    x=rad(x);
    y=rad(y);
    if(x==y)return;
    if(sz[x]<sz[y])swap(x,y);
    sz[x]+=sz[y];
    t[y]=x;
}
int main()
{
    int n,q;
    fin>>n>>q;
    for(int i=1;i<=n;i++){t[i]=i;sz[i]=1;}
    while(q--)
    {
        int op, x,y;
        fin>>op>>x>>y;
        if(op==1)
        {
            un(x,y);
        }
        if(op==2)
        {
            rad(x)==rad(y) ? fout<<"DA\n" : fout<<"NU\n";
        }

    }
}