Pagini recente » Cod sursa (job #1928004) | Cod sursa (job #1179022) | Cod sursa (job #2820094) | Cod sursa (job #2366515) | Cod sursa (job #3134992)
#include <bits/stdc++.h>
using namespace std;
void file_in(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
const int N = 100100;
using ll = long long;
vector<int> t(N, 0);
vector<ll> nr(N, 1);
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]) {
t[rx] = ry;
nr[ry] += nr[rx];
} else {
t[ry] = rx;
nr[rx] += nr[ry];
}
}
bool interogare(int x, int y) {
return (radacina(x) == radacina(y));
}
int main() {
file_in("disjoint");
int n, m;
cin >> n >> m;
for(int i = 1; i <= m; i++) {
int cod, x, y;
cin >> cod >> x >> y;
if(cod == 1) {
reuniune(x, y);
} else {
cout << (interogare(x, y) ? "DA\n" : "NU\n");
}
}
}