Cod sursa(job #1136026)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 8 martie 2014 18:13:37
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <cstdio>

#define Nmax 100005

using namespace std;

int daddy[Nmax];

int whos_ur_daddy(int k)
{
    if(daddy[k] != k)
        daddy[k] = whos_ur_daddy(daddy[k]);
    return daddy[k];
}
void couple(int a,int b)
{
    daddy[daddy[a]] = daddy[b];
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);

    int N,M,tip,a,b;
    scanf("%d%d",&N,&M);
    for(int i = 1; i <= N; ++i) daddy[ i ] = i;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d%d",&tip,&a,&b);
        if(tip == 1)
        {
            whos_ur_daddy(a);
            whos_ur_daddy(b);
            couple(a,b);
        }
        else
        {
            printf("%s",whos_ur_daddy(a) == whos_ur_daddy(b)?"DA\n":"NU\n");
        }
    }

    return 0;
}