Pagini recente » Cod sursa (job #2270519) | Cod sursa (job #2723748) | Cod sursa (job #2753718) | Cod sursa (job #709250) | Cod sursa (job #2950606)
#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 (x == t[x])
{
return x;
}
return t[x] = rad(t[x]);
}
void uniune (int x, int y)
{
t[x] = y;
}
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;
if (op == 1)
{
uniune(rad(x), rad(y));
}
else
{
int rx = rad(x), ry = rad(y);
if (rx == ry)
{
out << "DA" << '\n';
}
else
{
out << "NU" << '\n';
}
}
}
in.close();
out.close();
return 0;
}