Cod sursa(job #2115794)
Utilizator | Data | 27 ianuarie 2018 10:13:58 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int MAXNM = 100001;
int parent[MAXNM];
int n, m;
int root(int x) {
if (parent[x] == 0)
return x;
parent[x] = root(parent[x]);
}
int main() {
fin >> n >> m;
int p, x, y;
for (int i = 0; i < m; i++) {
fin >> p >> x >> y;
if (p == 2) {
int parent1 = root(x), parent2 = root(y);
fout << (parent1 == parent2 ? "DA" : "NU");
}
else {
parent[root(y)] = x;
}
}
return 0;
}