Cod sursa(job #3361441)
| Utilizator | Data | 24 iulie 2026 13:15:50 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main () {
int n, m, a, x, y;
fin >> n >> m;
vector<int> v(n+1, 0);
for(int i=1; i<=n; i++) {
v[i] = i;
}
for(int i=0; i<m; i++){
fin >> a >> x >> y;
if(a==1) {
int vy = v[y];
for(int i=1; i<=n; i++){
if(v[i]==vy) v[i]=v[x];
cout << v[i];
}
cout << endl;
} else {
if(v[y]==v[x]) fout << "DA\n";
else fout << "NU\n";
}
}
return 0;
}