Cod sursa(job #1640127)

Utilizator gapdanPopescu George gapdan Data 8 martie 2016 15:59:10
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <cstdio>
#define NMAX 100005

using namespace std;

int tata[NMAX];
int n,m,i,j,x,y,t;

int mul(int x)
{
    if(tata[x] == 0) return x;
    tata[x]=mul(tata[x]);
    return tata[x];
}

void reuneste(int x,int y)
{
    tata[mul(x)]=mul(y);
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i)
    {
        scanf("%d",&t);
        if(t == 1)
        {
            scanf("%d%d",&x,&y);
            reuneste(x,y);
        }
        else
        {
            scanf("%d%d",&x,&y);
            if(mul(x) != mul(y)) printf("NU\n");
                else printf("DA\n");
        }
    }
    return 0;
}