Cod sursa(job #1126330)

Utilizator ovidiu95Decean Ovidiu Ciprian ovidiu95 Data 26 februarie 2014 22:41:43
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include<cstdio>
#define Nmax 100005

using namespace std;
int i,a,b,c,m,n,t[Nmax],gr[Nmax];

int vf(int x)
{
    while(t[x]!=x) x=t[x];
    return x;
}

void unire(int x,int y)
{
    if(gr[x]>gr[y]) t[y]=x;
    else if(gr[x]<gr[y]) t[x]=y;
    else{t[y]=x; ++gr[x];}
}

int main()
{
    freopen("disjoint","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i) {t[i]=i; gr[i]=1;}
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&c,&a,&b);
        if(c==1) unire(vf(a),vf(b));
        if(c==2) if(vf(a)==vf(b)) printf("DA\n"); else printf("NU\n");
    }
    return 0;
}