Cod sursa(job #3190787)

Utilizator dragoncrackCandidatu Mario Luca dragoncrack Data 8 ianuarie 2024 08:08:06
Problema Paduri de multimi disjuncte Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 kb
#include <fstream>
#include <vector>

#define DIM 100005

using namespace std;

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

vector<int> elements[DIM];
int multimi[DIM];
int n, m;

void reuneste(int multime1, int multime2){
    int size1 = elements[multime1].size();
    int size2 = elements[multime2].size();
    if(size1 < size2){
        for(int i = size1 - 1; i >= 0; i--){
            multimi[elements[multime1][i]] = multime2;
            elements[multime2].push_back(elements[multime1][i]);
            elements[multime1].pop_back();
        }
    }
    else{
        for(int i = size2 - 1; i >= 0; i--){
            multimi[elements[multime2][i]] = multime1;
            elements[multime1].push_back(elements[multime2][i]);
            elements[multime2].pop_back();
        }
    }
}

string query(int x, int y){
    if(multimi[x] == multimi[y]){
        return "DA";
    }
    else{
        return "NU";
    }
}

int main()
{
    fin >> n;
    fin >> m;
    for(int i = 1; i <= n; i++){
        elements[i].push_back(i);
        multimi[i] = i;
    }
    int op, x, y;
    for(int i = 1; i <= m; i++){
        fin >> op >> x >> y;
        if(op == 1){
            reuneste(multimi[x], multimi[y]);
        }
        else{
            fout << query(x, y) << "\n";
        }
        /*
        for(int j = 1; j <= n; j++){
            fout << multimi[j] << " ";
        }
        fout << "\n";
        */
    }
}