Pagini recente » Cod sursa (job #141225) | Cod sursa (job #1479865) | Cod sursa (job #2422208) | Cod sursa (job #2473970) | Cod sursa (job #1784163)
#include <cstdio>
#include <vector>
using namespace std;
struct Nod
{
vector<int> v;
int p;
} v[100000];
void sett(int a, int b)
{
v[b].p = a;
for(int i = 0; i < v[b].v.size(); i++)
{
sett(a, v[b].v[i]);
}
}
int main()
{
int n, m, i, a, b, cer;
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
scanf("%d%d", &n, &m);
for(i = 0; i < n; i++)
v[i].p = i;
for(i = 0; i < m; i++)
{
scanf("%d%d%d", &cer, &a, &b);
if(cer == 1)
{
sett(a - 1, b - 1);
v[a - 1].v.push_back(b - 1);
}
else
{
if(v[a - 1].p == v[b - 1].p)
printf("DA\n");
else printf("NU\n");
}
}
return 0;
}