Cod sursa(job #1442762)

Utilizator tudor00Stoiean Tudor tudor00 Data 26 mai 2015 10:54:42
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <fstream>

using namespace std;

ifstream in("disjoint.in");
ofstream out("disjoint.out");

const int NMAX=100010;
int n,m,c,i,x,y;
int tatal[NMAX];

int query(int x)
{
    int R=x;
    while(R!=tatal[R]) R=tatal[R];
    while(x!=R)
    {
        int aux=tatal[x];
        tatal[x]=R;
        x=aux;
    }
    return R;
}

int main()
{
    in>>n>>m;
    for(i=1;i<=n;i++) tatal[i]=i;
    for(i=1;i<=m;i++)
    {
        in>>c>>x>>y;
        if(c==1)
        {
            tatal[query(x)]=query(y);
        }
        else
        {
            if(query(x)==query(y)) out<<"DA"<<'\n';
            else out<<"NU"<<'\n';
        }
    }
    return 0;
}