Cod sursa(job #2287178)

Utilizator jaocChitu Stefan Catalin jaoc Data 21 noiembrie 2018 17:14:47
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
#define NMAX 100020
int rang[NMAX],v[NMAX];
int rad(int x)
{
    int r=x,aux;
    //cautare radacina
    while(v[r]!=r)
        r=v[r];
    //compresia drumurilor
    while(x!=v[x])
    {
        aux = v[x];
        v[x] = r;
        x = aux;
    }
    return r;
}
void unite(int x,int y)
{
    if(rang[x]>rang[y])
        v[y]=x;
    else v[x]=y;
    if(rang[x]==rang[y])
        rang[y]++;
}
int main()
{
    int n,m,x,y,cod;
    in >> n >> m;
    for(int i=1;i<=n;i++)
    {
        v[i]=i;
        rang[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        in >> cod >> x >> y;
        if(cod==2)
        {
            if(rad(x)==rad(y))
                out << "DA" << '\n';
            else out << "NU" << '\n';
        }
        else unite(rad(x),rad(y));
    }
    return 0;
}