Cod sursa(job #1165652)

Utilizator lianaliana tucar liana Data 2 aprilie 2014 20:06:25
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include<stdio.h>
#define nmax 100005
int x, xx, y, op, r, xurm, m, i, n;
int t[nmax], ad[nmax];

int rad(int x)
{
    xx=x;
    while (t[x]!=x)
        x=t[x];
    r=x;
    x=xx;
    while (t[x]!=x)
    {
        xurm=t[x];
        t[x]=r;
        x=xurm;
    }
    return r;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%ld %ld",&n,&m);
    for(i=1;i<=n;i++)
        t[i]=i;
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld %ld",&op,&x,&y);
        if (op==1)
        {
            x=rad(x);   y=rad(y);
            if (ad[x]<ad[y])
                t[x]=y;
            else
            {
                t[y]=x;
                if (ad[x]==ad[y])
                    ad[x]++;
            }
        }
        else
        {
            if (rad(x)==rad(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}