Cod sursa(job #3264947)

Utilizator Manolea_Teodor_StefanManolea Teodor Stefan Manolea_Teodor_Stefan Data 25 decembrie 2024 22:25:17
Problema Paduri de multimi disjuncte Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h>
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

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

int n,m;
vector<int> t(100001,-1);

int getRoot(int node) {
    while (t[node] > 0) {
        node = t[node];
    }
    return node;
}

void connect(int a, int b) {
    const int rootA = getRoot(a);
    const int rootB = getRoot(b);
    if (rootA == rootB) {
        return;
    }
    if (rootA > rootB) {
        t[rootB] += t[rootA];
        t[rootA] = rootB;
    } else {
        t[rootA] += t[rootB];
        t[rootB] = rootA;
    }
}
const string ans[] = {"NU\n","DA\n"};
int main() {
    fin >> n >> m;
    while (m--) {
        int t,a,b;
        fin >> t >> a >> b;
        if (t == 1) {
            connect(a,b);
        } else {
            //fout << ans[getRoot(a) == getRoot(b)];
        }
    }
    return 0;
}