Cod sursa(job #2063938)

Utilizator mirunafrancescaMiruna mirunafrancesca Data 11 noiembrie 2017 17:12:01
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <stdio.h>

using namespace std;

int radacina(int x, int p[])
{
    int current = x;
    while(p[current] != current)
    {
        current = p[current];
        p[x] = current;
    }
    return current;
}

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

    int x,y,op,p[100000]={0},n,m;
    bool ok;
    cin>>n>>m;

    for(int i=1; i<=n; i++)
        p[i]=i;
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d %d \n",&op, &x, &y);
        if(op==1)
        {
            p[radacina(x,p)]=radacina(y,p);
        }
        else
        {
            if(radacina(x,p)==radacina(y,p))
                printf("DA \n");
            else
                printf("NU \n");
        }

    }

    return 0;
}