Cod sursa(job #1770611)

Utilizator B_RazvanBaboiu Razvan B_Razvan Data 4 octombrie 2016 17:43:31
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include <iostream>
#include <cstdio>

using namespace std;

int n, m, t[100005], in[100005];

void citire()
{
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; ++i)
        {
            t[i]=i;
            in[i]=1;
        }
}

int radacina(int x)
{
    while(x!=t[x])
    {
        x=t[x];
    }
    return x;
}

void reunireMultimi(int x, int y)
{
    if(in[x]>=in[y])
        {
            t[radacina(y)]=radacina(x);
            in[x]=max(in[x], in[y]+1);
            in[y]=in[x];
        }
    else
        {
            t[radacina(x)]=radacina(y);
            in[y]=max(in[y], in[x]+1);
            in[x]=in[y];
        }
}

int verificareMultime(int x, int y)
{
    if(radacina(x)==radacina(y))
        return 1;
    return 0;
}

void rezolvare()
{
    int cod, x, y;
    for(int i=1; i<=m; ++i)
    {
        scanf("%d %d %d", &cod, &x, &y);
        if(cod==1)
        {
            reunireMultimi(x, y);
        }
        else
        {
            if(verificareMultime(x, y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
}

int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    citire();
    rezolvare();
    return 0;
}