Cod sursa(job #669507)
#include<cstdio>
using namespace std;
int t[100005],h[100005],n,m;
int find(int x)
{
for(;t[x]!=x;x=t[x]);
return x;
}
void unit(int x, int y)
{
if(h[x]>h[y])
t[y]=x;
if(h[y]>h[x])
t[x]=y;
if(h[x]==h[y])
{
h[x]++;
t[y]=x;
}
}
int x,y;
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
int x,y,cod,tx,ty;
for(int i=1;i<=n;i++)
t[i]=i;
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&cod,&x,&y);
tx=find(x);
ty=find(y);
if(cod==1)
unit(x,y);
if(cod==2)
{
if(tx==ty)
printf("DA\n");
if(tx!=ty)
printf("NU\n");
}
}
return 0;
}