Pagini recente » Cod sursa (job #108836) | Cod sursa (job #2539115) | Cod sursa (job #1753026) | Cod sursa (job #3273010) | Cod sursa (job #2676526)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
vector<int> component[100001];
int n, m, whichComponent[100001];
int main() {
fin.tie(0);
fout.tie(0);
ios::sync_with_stdio(0);
fin >> n >> m;
int operation, a, b;
for (int i = 1; i <= n; i++) {
whichComponent[i] = i;
component[i].push_back(i);
}
for (int i = 0; i < m; i++) {
fin >> operation >> a >> b;
if (operation == 1) {
for (int it : component[a]) {
whichComponent[it] = whichComponent[b];
component[whichComponent[b]].push_back(it);
}
}
else {
if (whichComponent[a] == whichComponent[b])
fout << "DA\n";
else
fout << "NU\n";
}
}
return 0;
}