Cod sursa(job #2136991)

Utilizator dragostanTantaru Dragos Constantin dragostan Data 20 februarie 2018 15:13:42
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.99 kb
#include <fstream>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int DIM = 100001;
int t[DIM], h[DIM];
int n;
int radacina(int x);
void uniune(int x, int y);
bool ask(int x, int y);
int main()
{
    int q;
    cin >> n >> q;
    for(int i = 1; i <= q; ++i)
    {
        int x, y, which;
        cin >> which >> x >> y;
        if(which == 1)
            uniune(x, y);
        else
        {
            if(ask(x, y))
                cout << "DA\n";
            else
                cout << "NU\n";
        }
    }
    return 0;
}

int radacina(int x)
{
    if(t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

void uniune(int x, int y)
{
    int rx = radacina(x), ry = radacina(y);
    if(h[rx] < h[ry])
    {
        t[rx] = ry;
    }
    else
    {
        t[ry] = rx;
        if(h[ry] == h[rx])
            ++h[ry];
    }
}

bool ask(int x, int y)
{
    if(radacina(x) == radacina(y))
        return true;
    return false;
}