Pagini recente » Cod sursa (job #3305545) | Cod sursa (job #3357337) | Cod sursa (job #3357768) | Cod sursa (job #3306355) | Cod sursa (job #3310019)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int NMAX = 1e5 + 5;
struct DSU {
int rep[NMAX];
int sizee[NMAX];
DSU(int n) {
for (int i = 1; i <= n; i++) {
rep[i] = i;
sizee[i] = 1;
}
}
int get_rep(int a) {
if (rep[a] == a) return a;
return rep[a] = get_rep(rep[a]);
}
bool same_set(int a, int b) {
int ra = get_rep(a);
int rb = get_rep(b);
return ra == rb;
}
void join(int a, int b) {
int ra = get_rep(a);
int rb = get_rep(b);
if (ra == rb) return;
if (sizee[ra] < sizee[rb]) swap(ra, rb);
rep[rb] = ra;
sizee[rb] += sizee[ra];
}
};
int main()
{
int n, m;
fin >> n >> m;
DSU dsu(n);
while (m--) {
int t, a, b;
fin >> t >> a >> b;
if (t == 1) dsu.join(a, b);
else if (dsu.same_set(a, b)) {
fout << "DA \n";
}
else fout << "NU \n";
}
return 0;
}