Pagini recente » Cod sursa (job #3163287) | Cod sursa (job #2806191) | Cod sursa (job #1205289) | Cod sursa (job #1857860) | Cod sursa (job #2115818)
#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;
int p = root(parent[x]);
parent[x] = p;
return p;
}
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(x)] = root(y);
}
}
return 0;
}