Cod sursa(job #2304041)

Utilizator radugheoRadu Mihai Gheorghe radugheo Data 17 decembrie 2018 14:04:56
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>

using namespace std;

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

int t[100005], x, y, i, n, m, c, rx, ry;

int rad (int x){
    while (t[x] > 0){
        x = t[x];
    }
    return x;
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=n; i++){
        t[i] = -1;
    }
    for (i=1; i<=m; i++){
        fin >> c >> x >> y;
        rx = rad (x), ry = rad (y);
        if (c == 2){
            fout << (rx == ry ? "DA" : "NU") << "\n";
        }
        else {
            if (rx != ry){
                if (t[rx] < t[ry]){
                    t[rx] += t[ry];
                    t[ry] = rx;
                }
                else{
                    t[ry] += t[rx];
                    t[rx] = ry;
                }
            }
        }
    }
    return 0;
}