Cod sursa(job #2011797)

Utilizator vdorastieNegru Vlad vdorastie Data 17 august 2017 11:25:58
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <iostream>
#include <fstream>
using namespace std;
int tata[100003], rng[100003], v, x, y, i, n, m;
int rad(int x)
{
    int T, y;
    for(T=x; tata[T]!=T; T=tata[T]);
    while(tata[x]!=x)
    {
        y=tata[x];
        tata[x]=T;
        x=y;
    }
    return T;
}
void unesc(int x, int y)
{
    if(rng[x]>rng[y])
        tata[y]=x;
        else tata[x]=y;

    if(rng[x]==rng[y]) rng[y]++;
}
int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin>>n>>m;
    for(i=1; i<=n; i++) tata[i]=i, rng[i]=1;

    for(i=1; i<=m; i++)
    {
        fin>>v>>x>>y;
        if(v==2)
        {
            if(rad(x)==rad(y)) fout<<"DA"<<"\n";
            else fout<<"NU"<<"\n";
        }
        else if (v==1)
        {
            unesc(rad(x), rad(y));
        }
    }
    return 0;
}