Pagini recente » Cod sursa (job #1356142) | Cod sursa (job #2617707) | Cod sursa (job #2848951) | Cod sursa (job #435883) | Cod sursa (job #1360680)
#include<cstdio>
#include<string>
using namespace std;
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "disjoint";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif
const int NMAX = 100000 + 5;
int N, M;
int root[NMAX];
int find(int x) {
if(x != root[x])
root[x] = find(root[x]);
return root[x];
}
void unite(int x, int y) {
root[x] = y;
}
int main() {
int t, i, x, y;
freopen(inputFile.c_str(), "r", stdin);
freopen(outputFile.c_str(), "w", stdout);
scanf("%d%d", &N, &M);
for(i = 1; i <= N; i++)
root[i] = i;
while(M--) {
scanf("%d%d%d", &t, &x, &y);
if(t == 1) {
unite(find(x), find(y));
continue;
}
if(t == 2) {
printf("%s\n", (find(x) == find(y)) ? "DA" : "NU");
continue;
}
}
return 0;
}