Cod sursa(job #1087643)

Utilizator Vladinho97Iordan Vlad Vladinho97 Data 19 ianuarie 2014 17:56:16
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <cstdio>
using namespace std;

int dad[100009];
int radacina(int x)
{
    if(x!=dad[x])
        dad[x]=radacina(dad[x]);
    return dad[x];
}
void uneste(int x,int y)
{
    dad[radacina(x)]=radacina(y);
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,op,x,i,y;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        dad[i]=i;
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==1)
            uneste(x,y);
        if(op==2)
        {
            if(radacina(x)==radacina(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}