Cod sursa(job #1089507)

Utilizator lianaliana tucar liana Data 21 ianuarie 2014 18:57:46
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include<stdio.h>
#define nmax 100005
int i, n, m, aurm, r, ainit, op, a, x, y;
int t[nmax], ad[nmax];

int rad(int a)
{
    ainit=a;
    while (t[a]!=a)
        a=t[a];
    r=a;
    a=ainit;
    while (t[a]!=a)
    {
        aurm=t[a];
        t[a]=r;
        a=aurm;
    }
    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; ad[i]=1;    }
    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;
                if (ad[x]==ad[y])
                    ad[y]++;
            }
            else
                t[y]=x;
        }
        else
        {
            if (rad(x)==rad(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}