Cod sursa(job #788697)
Utilizator | Data | 15 septembrie 2012 16:52:30 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
#define Max 100001
int n,rad[Max];
int tata(int x)
{
if(rad[x] != x)rad[x]=tata(rad[x]);
return rad[x];
}
int main()
{
int m,c,x,y;
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)rad[i]=i;
while(m--)
{
scanf("%d %d %d",&c,&x,&y);
if(c==1)rad[tata(x)]=tata(y); else
if(tata(x)==tata(y))printf("DA\n"); else printf("NU\n");
}
return 0;
}