Pagini recente » fmi-no-stress-2012/clasament | Cod sursa (job #31264) | Cod sursa (job #542790) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #2083352)
#include <bits/stdc++.h>
using namespace std;
inline void Boost() {
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
}
const int NMax = 1e5 + 50;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int Father[NMax];
int Group(int val) {
if(Father[val] == val) return val;
Father[val] = Group(Father[val]);
return Father[val];
}
void Reunion(int b, int c) {
Father[Group(b)] = Group(c);
}
void Solve(int b, int c) {
Group(b);
Group(c);
if(Father[b] == Father[c]) {
fout << "DA\n";
} else {
fout << "NU\n";
}
}
int main() {
Boost();
int n, q;
fin >> n >> q;
for(int i = 1; i <= n; ++i) Father[i] = i;
while(q--) {
int a, b, c;
fin >> a >> b >> c;
if(a == 1) {
Reunion(b, c);
} else {
Solve(b, c);
}
}
return 0;
}