Cod sursa(job #2050677)

Utilizator RaduGiucleaGiuclea Radu RaduGiuclea Data 28 octombrie 2017 10:58:33
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <cstdio>
using namespace std;
int daddy[100002];
int feind(int x)
{
    if(daddy[x]==x)
        return x;
    return daddy[x]=feind(daddy[x]);
}
void u1600(int x,int y)
{
    int a,b;
    a=feind(x);
    b=feind(y);
    daddy[a]=b;
}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,i,x,y,cod;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        daddy[i]=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&cod,&x,&y);
        if(cod==1)
            u1600(x,y);
        else if(feind(x)!=feind(y))
            printf("NU\n");
            else printf("DA\n");
    }
    return 0;
}