Cod sursa(job #2702269)

Utilizator DragosC1Dragos DragosC1 Data 3 februarie 2021 14:48:31
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <fstream>
using namespace std;

int n;
int T[100001];

int Radacina(int x) {
    if (x == T[x]) return x;
    else return T[x] = Radacina(T[x]);
}

void Uneste(int x, int y) {
    if (T[x] > T[y]) T[x] = T[y];
    else T[y] = T[x];
}

int main() {
    int i, m, op, x, y;
    ifstream f("disjoint.in");
    f >> n >> m;
    for (i = 1; i <= n; i++)
        T[i] = i;
    ofstream g("disjoint.out");
    for (i = 1; i <= m; i++) {
        f >> op >> x >> y;
        if (op == 1)
            Uneste(Radacina(x), Radacina(y));
        else if (Radacina(x) == Radacina(y))
            g << "DA\n";
        else g << "NU\n";
    }
    g.close();
    f.close();
    return 0;
}