Cod sursa(job #744737)

Utilizator test0Victor test0 Data 9 mai 2012 16:10:17
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <cstdio>
#define MAX 100010
int rad[MAX];

int tata(int x){
    while(x!=rad[x])x=rad[x];
    return x;
}

int main(){
    int n,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;
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d %d",&c,&x,&y);
            if(c==1)rad[tata(x)]=y; else
            if(tata(x)==tata(y))printf("DA\n"); else printf("NU\n");
        }
        fclose(stdout);
    return 0;
}