Cod sursa(job #759195)
| Utilizator | Data | 17 iunie 2012 09:18:29 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <cstdio>
#define MAX 100001
int n,rad[MAX];
int tata(int x){
while(x!=rad[x])x=rad[x];
return 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);
switch(c){
case 1: rad[tata(x)]=tata(y); break;
case 2: if(tata(x)==tata(y))printf("DA\n"); else printf("NU\n");
}
}
return 0;
}
