Cod sursa(job #735018)

Utilizator test0Victor test0 Data 15 aprilie 2012 16:07:41
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <stdio.h>
#define MAX 100001
int rad[MAX],n,m;

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

void update(int x){
    if(x!=rad[x])update(rad[x]); else
    return;
    rad[x]=rad[rad[x]];
}

int main(){
    int 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);
            switch(c){
                case 1: rad[tata(x)]=tata(y); break;
                case 2:
                if(tata(x)==tata(y))printf("DA\n"); else printf("NU\n");
                update(x);
                update(y);
                break;
            }
        }
}