Pagini recente » Cod sursa (job #1225072) | Cod sursa (job #1510362) | Cod sursa (job #2267161) | Cod sursa (job #330076) | Cod sursa (job #3040359)
/// DSU cu reuniune FARA rang
#include <fstream>
using namespace std;
ifstream in ("disjoint.in");
ofstream out ("disjoint.out");
const int max_size = 1e5 + 1;
int t[max_size];
int rad (int x)
{
if (t[x] == x)
{
return x;
}
return t[x] = rad(t[x]);
}
int main ()
{
int n, q;
in >> n >> q;
for (int i = 1; i <= n; i++)
{
t[i] = i;
}
while (q--)
{
int op, x, y;
in >> op >> x >> y;
int rx = rad(x), ry = rad(y);
if (op == 1)
{
t[rx] = ry;
}
else
{
if (rx == ry)
{
out << "DA" << '\n';
}
else
{
out << "NU" << '\n';
}
}
}
in.close();
out.close();
return 0;
}