Cod sursa(job #2374708)
| Utilizator | Data | 7 martie 2019 20:04:48 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
#define N 100001
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[N],n;
int caut(int x)
{
if(x==t[x])
return x;
else
{
t[x]=caut(t[x]);
return (t[x]);
}
}
int main()
{
int n,a,b,i,caz,x,y,m;
fin>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
for(i=1;i<=m;i++)
{
fin>>caz>>a>>b;
if(caz==1)
{
a=caut(a);
b=caut(b);
t[a]=b;
}
else
{
if(caut(a)==caut(b))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}