Cod sursa(job #1337345)

Utilizator NacuCristianCristian Nacu NacuCristian Data 8 februarie 2015 21:38:47
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <cstdio>
#include <vector>

using namespace std;

int tata[100000];
int m,n;
int parinte(int x)
{
    if(tata[x]==x)
        return x;
    tata[x]=parinte(tata[x]);
    return tata[x];
}

void citire()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&m);

    for(int i=1;i<=n;i++)
        tata[i]=i;

    for(int i=0;i<m;i++)
    {
        int t,a,b;
        scanf("%d %d %d",&t,&a,&b);
        if(t==1)
            if(parinte(a)!=parinte(b))
                tata[parinte(a)]=parinte(b);
        if(t==2)
            if(parinte(a)==parinte(b))
                printf("DA\n");
            else
                printf("NU\n");
        }

}

int main()
{
    citire();
    return 0;
}