Pagini recente » Cod sursa (job #1237828) | Cod sursa (job #268106) | Cod sursa (job #2393508) | Cod sursa (job #1230298) | Cod sursa (job #1013590)
#include <stdio.h>
int t[100000];
int radacina(int x)
{
if(t[x]==0) return x;
t[x]=radacina(t[x]);
return t[x];
}
int main()
{
int n,m,i,x,y,cod;
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&cod,&x,&y);
if(cod == 1)
t[radacina(y)]=radacina(x);
if(cod == 2)
if(radacina(x)==radacina(y))
printf("DA\n");
else printf("NU\n");
}
return 0;
}