Cod sursa(job #2559671)

Utilizator mihneazarojanuMihnea Bogdan Zarojanu mihneazarojanu Data 27 februarie 2020 14:55:39
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <fstream>

using namespace std;

const int N = 100001;

int nr[N], t[N];

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);
    int ry = radacina(y);
    if(nr[rx] < nr [ry]){
        t[rx] = ry;
        nr[ry] += nr[rx];
    }else{
        t[ry] = rx;
        nr[rx] += nr[ry];
    }
}

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

int main(){
    int n, m;
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    in >> n >> m;
    for(int i = 0; i < m; i++){
        int p, x, y;
        in >> p >> x >> y;
        if(p == 1){
            reuniune(x, y);
        }
        if(p == 2){
            if(interogare(x, y)){
                out << "DA\n";
            }else{
                out << "NU\n";
            }
        }
    }
    in.close();
    out.close();
    return 0;
}