Cod sursa(job #2768166)

Utilizator NanuGrancea Alexandru Nanu Data 9 august 2021 17:02:03
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.89 kb
#include <fstream>
#include <vector>

using namespace std;

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

#define DIM 100001

int t[DIM], n, m, x, y, tip;

static inline int radacina(int x) {
    if(t[x] == x)
        return x;
    int y = radacina(t[x]); ///aflu tatal tatalui;
    t[x] = y;
    return y;
}

static inline void Union(int x, int y) {
    int tx = radacina(x);
    int ty = radacina(y);
    t[ty] = t[tx];
}

int main() {
    cin >> n >> m;

    for(int i = 1; i <= n; i++)
        t[i] = i;   ///fiecare e initial tatal sau;

    for(int i = 1; i <= m; i++) {
        cin >> tip >> x >> y;
        if(tip == 1)
            Union(x, y);
        else {
            int tx = radacina(x);
            int ty = radacina(y);
            cout << (tx == ty ? "DA" : "NU") << '\n';   ///daca au aceeasi radacina;
        }
    }

    return 0;
}