Cod sursa(job #897555)

Utilizator andreea29Iorga Andreea andreea29 Data 27 februarie 2013 21:13:40
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include<fstream>
#include<cstdlib>

#define Nmax 100010

using namespace std;

int x, y, op, n, m, par[Nmax], i;

int find(int x)
{
    if (par[x] == x)
        return x;

    par[x] = find(par[x]);

    return par[x];
}

void unite(int x, int y)
{

    if (x == y)
        return;

    //if (rand() & 1)
        par[x] = y;
    //else
      //  par[y] = x;

}

int main()
{
    ifstream f ("disjoint.in");
    ofstream h ("disjoint.out");
    f >> n >> m;
    for (i = 1; i <= n; ++i)
    {
        par[i] = i;
    }

    for (i = 1; i <= m; ++i)
    {
        f >> op >> x >> y;
        if (op == 2)
            if (find(x) == find(y))
                h << "DA\n";
            else
                h << "NU\n";
        else
            unite(find(x), find(y));
    }
    f.close();
    h.close();
    return 0;
}