Cod sursa(job #2173392)

Utilizator clokerulLazureanu George clokerul Data 15 martie 2018 22:01:12
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <fstream>

using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100001], h[100001];
int n;
int radacina(int x);
void uniune(int x, int y);
bool ask(int x, int y);
int main()
{
    int m,x,y,cod;
    in >> n >> m;
    while (m)
    {
        in >> cod >> x >> y;
        if (cod==1)
            uniune(x,y);
        else
            if (ask(x,y))
                out << "DA" << '\n';
            else
                out << "NU" << '\n';
        m--;
    }
    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[x]>h[y])
    {
        t[ry]=rx;
    }
    else
    {
        t[rx]=ry;
        if (h[x]==h[y])
            h[x]++;
    }
}
bool ask(int x,int y)
{
    return radacina(x)==radacina(y);
}