Cod sursa(job #785499)

Utilizator round1First Round round1 Data 9 septembrie 2012 11:42:01
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <cstdio>
#define Max 100001

int rad[Max],n;

int tata(int x)
{
    if(x != rad[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;
}