Pagini recente » Cod sursa (job #223924) | Cod sursa (job #2564410) | Cod sursa (job #582063) | Cod sursa (job #1942434) | Cod sursa (job #2207022)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int N = 1e5 + 9;
int t[N], nr[N];
int radacina(int x) {
if (t[x] == 0) {
return x;
}
t[x] = radacina(t[x]);
return t[x];
}
void reuniune(int x , int y) {
int rx = radacina(x), ry = radacina(y);
if (nr[rx] < nr[ry]) {
nr[rx] += nr[ry];
t[rx] = ry;
}
else {
nr[ry] += nr[rx];
t[ry] = rx;
}
}
bool comun(int x, int y) {
return (radacina(x) == radacina(y));
}
int main() {
int n, m, x, y, op;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
t[i] = 0;
nr[i] = 1;
}
for (int i = 0; i < m; ++i) {
cin >> op >> x >> y;
if (op - 1) {
if (comun(x, y)) {
cout << "DA\n";
}
else {
cout << "NU\n";
}
}
else {
reuniune(x, y);
}
}
return 0;
}