Cod sursa(job #624308)

Utilizator 1994Barbulescu Daniel 1994 Data 22 octombrie 2011 10:43:31
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <cstdio>
using namespace std;

int n,m;
int t[100010];

void start()
{
    for (int i=1;i<=n;i++)
        t[i]=i;
}

int f(int i)
{
    if (t[i]==i)
        return i;
    return t[i]=f(t[i]);
}


void read()
{
    int x,y,cod;
    scanf("%d %d",&n,&m);
    start();
    for (int w=1;w<=m;w++)
    {
        scanf("%d %d %d",&cod,&x,&y);
        if (cod==1)
            t[f(y)]=f(x);
        else
        {
            if (f(y)==f(x))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
}

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