Cod sursa(job #2559474)

Utilizator Ioan_AnghelIoan Anghel Ioan_Anghel Data 27 februarie 2020 12:38:29
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#include <iostream>
#include <fstream>

using namespace std;

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

const int N = 100001;
int t[N], nr[N];

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

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

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

int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 0; i < m; i++){
        int code, x, y;
        in >> code >> x >> y;
        if(code == 1){
            reuniune(x, y);
        }
        else{
            if(interogare(x, y)){
                out << "DA" << "\n";
            }
            else{
                out << "NU" << "\n";
            }
        }
    }

    return 0;
}