Cod sursa(job #2602232)
| Utilizator | Data | 16 aprilie 2020 13:06:03 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int n,m,i,tip,x,y;
int dsu[100005];
int grup(int poz)
{
if(dsu[poz]==poz)
return poz;
return grup(dsu[poz]);
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
dsu[i]=i;
for(i=1;i<=m;i++)
{
fin>>tip>>x>>y;
if(tip==1)
{
dsu[grup(y)]=grup(x);
}
else
{
if(grup(x)==grup(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}
