Cod sursa(job #612787)

Utilizator 0pt1musOptimus 0pt1mus Data 10 septembrie 2011 07:05:47
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#include <cstring>

#define TSize 100001

using namespace std;

ifstream in;
ofstream out;

int T[TSize];

inline int root(int x)
{
    if(T[x]!=x) T[x]=root(T[x]);
    return T[x];
}

int main()
{
    int M,N,cod,x,y;

    memset(T,0,sizeof(T));

    in.open("disjoint.in");
    out.open("disjoint.out");

    in>>N>>M;

    for(int i=1;i<=N;++i) T[i]=i;

    for(;M--;)
    {
        in>>cod>>x>>y;

        x=root(x);
        y=root(y);

        if(cod==1) T[x]=y;
        else (x==y) ? out<<"DA\n" : out<<"NU\n";
    }

    in.close();
    out.close();

    return 0;
}