Pagini recente » Cod sursa (job #244862) | Cod sursa (job #567409) | Cod sursa (job #837799) | Cod sursa (job #2773358) | Cod sursa (job #2815899)
#include <fstream>
using namespace std;
ifstream cin ("disjoint.in");
ofstream cout ("disjoint.out");
int n, m, c, x, y;
int sefi[100001];
int sef (int x)
{
if (sefi[x] == x)
return x;
else
return sefi[x] = sef(sefi[x]);
}
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i++)
sefi[i] = i;
for (int i = 1; i <= m; i++)
{
cin >> c >> x >> y;
if (c == 1)
{
sefi[sef(y)] = sef(x);
}
else
{
if (sef(x) == sef(y))
cout << "DA" << '\n';
else
cout << "NU" << '\n';
}
}
return 0;
}