Cod sursa(job #1884817)

Utilizator silviuilasSilviu Ilas silviuilas Data 19 februarie 2017 12:05:58
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.56 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,c,x,y,rx,ry,i,t[100010],compacteaza(int);

int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=i;
    for(;m;m--)
    {
        f>>c>>x>>y;
        rx=compacteaza(x);
        ry=compacteaza(y);
        if(c==1)
            t[rx]=ry;
        else
            rx==ry?g<<"DA\n":g<<"NU\n";
    }
    return 0;
}
int compacteaza(int nod)
{
    if(t[nod]==nod)
        return nod;
    t[nod]=compacteaza(t[nod]);
    return t[nod];
}