Cod sursa(job #2046303)

Utilizator BourucLiviuBouruc Petru Liviu BourucLiviu Data 23 octombrie 2017 17:58:27
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>

using namespace std;

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

int tata[100005];

inline int dad(int x)
{
    if(tata[x] == x) return x;
    else return tata[x] = dad(tata[x]);
}

void unite(int x, int y)
{
    int tx, ty;
    tx = dad(x);
    ty = dad(y);
    tata[tx] = ty;
}

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