Cod sursa(job #301414)

Utilizator hasegandaniHasegan Daniel hasegandani Data 8 aprilie 2009 10:43:59
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<stdio.h>

#define Nmax 100001

int n,arb[Nmax];

void reuneste(int x,int y)
{
    while (arb[y])
        y=arb[y];
    arb[y]=x;
}

int interogare(int x,int y)
{
    while (arb[x])
        x=arb[x];
    while (arb[y])
        y=arb[y];
    if (x==y)
        return 1;
    return 0;
}

int main()
{
    int m,cod,x,y,a;
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
        {
        scanf("%d%d%d",&cod,&x,&y);
        if (cod==1)
            reuneste(x,y);
        else
            {
            a=interogare(x,y);
            if (a)
                printf("DA\n");
            else
                printf("NU\n");
            }
        }
    return 0;
}