Pagini recente » Cod sursa (job #2963414) | Cod sursa (job #3137046) | Cod sursa (job #2998892) | Cod sursa (job #3204856) | Cod sursa (job #1883956)
#include<cstdio>
int dad[100001];
int tata(int x)
{if(dad[x]==x)
return x;
else
return dad[x]=tata(dad[x]);
}
void join(int x,int y)
{int a,b;
a=tata(x);
b=tata(y);
dad[a]=b;
}
int main ()
{freopen ("disjoint.in","r",stdin);
freopen ("disjoint.out","w",stdout);
int n,m,i,t,x,y;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
dad[i]=i;
for(i=1;i<=m;i++)
{scanf("%d%d%d",&t,&x,&y);
if(t==1)
join(x,y);
else
if(tata(x)==tata(y))
printf("DA\n");
else
printf("NU\n");
}
return 0;
}