Pagini recente » Cod sursa (job #2961192) | Cod sursa (job #996516) | Cod sursa (job #2284380) | Cod sursa (job #1884552) | Cod sursa (job #2946559)
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
vector<int> parentVec;
int maxN, opCount, opType, a, b;
int GetRoot(int a) {
if (parentVec[a] == 0) {
return a;
}
parentVec[a] = GetRoot(parentVec[a]);
return parentVec[a];
}
void UnionSet(int a, int b) {
int rootA = GetRoot(a);
int rootB = GetRoot(b);
if (a>b) {
parentVec[rootA] = rootB;
}
else
parentVec[rootA] = rootB;
}
int main() {
ifstream myIn("disjoint.in");
myIn >> maxN >> opCount;
parentVec = vector<int>(maxN + 1, 0);
ofstream myOut("disjoint.out");
for (int i = 0; i < opCount; i++) {
myIn >> opType >> a >> b;
if (opType == 1) {
// reuniune
UnionSet(a, b);
}
else {
// bool
if (GetRoot(a) == GetRoot(b)) {
myOut << "DA" << endl;
}
else {
myOut << "NU" << endl;
}
}
}
myOut.close();
return 0;
}