Cod sursa(job #1010733)
Utilizator | Nechita Laura redls_95 | Data | 15 octombrie 2013 17:06:43 |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<cstdio>
using namespace std;
int t[100003];
int radacina(int x)
{
if (t[x]==0) return x;
int r=radacina(t[x]);
t[x]=r;
return r;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,i,j,k,l,a,b,c;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&a,&b,&c);
if (a==2)
{
if (t[b]==t[c]) printf("DA\n");
else printf("NU\n");
}
else
{
t[radacina(c)]=radacina(b);
}
}
return 0;
}