Cod sursa(job #1364965)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 27 februarie 2015 22:20:35
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <cstdio>

#define Nmax 100005

using namespace std;

int daddy[Nmax],N,M;

void Read()
{
    scanf("%d%d",&N,&M);
    for(int i = 1; i <= N; ++i)
        daddy[i] = i;
}


int whos_ur_daddy(int k)
{
    if(daddy[k] != k)
        daddy[k] = whos_ur_daddy(daddy[k]);
    return daddy[k];
}

void cupleaza (int a,int b)
{
    daddy[daddy[a]] = daddy[b];
}

void Solve()
{
    int T,a,b;
    for(int i = 1; i <= M; ++i)
    {
        scanf("%d%d%d",&T,&a,&b);
        if(T == 1)
            cupleaza(whos_ur_daddy(a),whos_ur_daddy(b));
        else
            if(whos_ur_daddy(a) == whos_ur_daddy(b))
                printf("DA\n");
            else
                printf("NU\n");
    }
}

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

    Read();
    Solve();

    return 0;
}