Cod sursa(job #2954213)
Utilizator | HAULICA TUDOR HAUBAU | Data | 13 decembrie 2022 16:47:55 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,q,T[100010];
int getRoot(int nod)
{
if(T[nod]==nod)
return nod;
T[nod]=getRoot(T[nod]);
return T[nod];
}
int main()
{
fin>>n>>q;
for(int i=1;i<=n;i++)
T[i]=i;
for(;q;q--)
{
int cod,x,y;
fin>>cod>>x>>y;
int rx=getRoot(x);
int ry=getRoot(y);
if(cod==1)
T[rx]=ry;
else
{
if(rx==ry)
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}