Cod sursa(job #2194257)

Utilizator edi9876Negescu Eduard Mihai edi9876 Data 12 aprilie 2018 18:00:00
Problema Paduri de multimi disjuncte Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <fstream>

using namespace std;

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

const int N = 100000;

int n, m;
int t[N] = {0};

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

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

bool interogare(int x, int y)
{
    return (radacina(x) == radacina(y));
}

int main()
{
    in >> n >> m;
    for(int i = 0; i < m; i++)
    {
        int x, a, b;
        in >> x >> a >> b;
        if(x == 1)
        {
            radacina(a);
            radacina(b);
            reuniune(a, b);
        }
        if(x == 2)
        {
            int rez = interogare(a, b);
            if(rez == true)
            {
                out << "DA\n";
            }
            else if(rez == false)
            {
                out << "NU\n";
            }
        }
    }
    return 0;
}