Pagini recente » Cod sursa (job #1895311) | Cod sursa (job #156382) | Cod sursa (job #1302696) | Cod sursa (job #978949) | Cod sursa (job #1371190)
#include <iostream>
#include <cstdio>
#define DMAX 100005
using namespace std;
int n, rt[DMAX], m;
int x, a, b;
int root(int k)
{
if(k!=rt[k])
rt[k]=root(rt[k]);
return rt[k];
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
cin>>n>>m;
for(int i=1;i<=n;i++)
rt[i]=i;
for(int i=1;i<=m;i++)
{scanf("%i %i %i", &x, &a, &b);
if(x==1)
{
rt[root(a)]=root(b);
}
else{
if(root(a)==root(b))
printf("DA\n");
else printf("NU\n");
}
}
return 0;
}