Pagini recente » Cod sursa (job #2143518) | Cod sursa (job #2688010) | Cod sursa (job #1612284) | Cod sursa (job #2932578) | Cod sursa (job #2510890)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n, m, v[100005];
void onion(int x, int y);
int findd(int x);
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
v[i] = i;
for(int i = 1; i <= m; i++)
{
int op, x, y;
cin >> op >> x >> y;
if(op == 1)
onion(x, y);
else
{
if(findd(x) == findd(y))
cout << "DA\n";
else
cout << "NU\n";
}
}
return 0;
}
void onion(int x, int y)
{
int rx = findd(x);
int ry = findd(y);
if(rx == ry)
return;
else
{
if(rx < ry)
v[rx] = ry;
else
v[ry] = rx;
}
}
int findd(int x)
{
if(v[x] == x)
return x;
int rx = findd(v[x]);
v[x] = rx;
return rx;
}