Cod sursa(job #1605716)

Utilizator dianaorasanuDiana Orasanu dianaorasanu Data 19 februarie 2016 13:43:23
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include <fstream>

#define NMAX 100010

using namespace std;

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

int unu(int);
void doi();

int n, m, op, x, y, i;
int tata[NMAX], h[NMAX];

int main()
{
    fin >> n >> m;
    for(i = 1; i <= n; ++i)
        tata[i] = -1;
    for(i = 1; i <= m; ++i)
    {
        fin >> op >> x >> y;
        if(op == 1)
        {
            x=unu(x);
            y=unu(y);
            if(h[x] > h[y])
                tata[y] = x;
            else
            {
                tata[x] = y;
                if(h[x] == h[y])
                    h[y]++;
            }
        }
        else
        {
            x = unu(x);
            y = unu(y);
            if(x == y)
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
    return 0;
}

int unu(int nod)
{
    if(tata[nod] == -1)
        return nod;
    else
    {
        tata[nod] = unu(tata[nod]);
        return tata[nod];
    }
}