Cod sursa(job #1782442)

Utilizator binicBinica Nicolae binic Data 18 octombrie 2016 09:33:16
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<cstdio>
using namespace std;
int n,m,x,y,Q,ta,tb,t[100004];
int tata(int x)
{
    if(t[x]==x)return x;
    return t[x]=tata(t[x]);
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
        t[i]=i;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&Q,&x,&y);
        if(Q==2)
        {
            ta=tata(x);
            tb=tata(y);
            if(ta==tb)printf("DA\n");
            else printf("NU\n");
        }
        else
        {
            ta=tata(x);
            tb=tata(y);
            t[ta]=tb;
        }
    }
    return 0;
}