Pagini recente » Cod sursa (job #260136) | Cod sursa (job #2516213) | Cod sursa (job #2334281) | Cod sursa (job #3194745) | Cod sursa (job #1144786)
#include<stdio.h>
int tata[100003];
int find(int x)
{
int r=x,aux;
while(tata[r]!=r)
{
r=tata[r];
}
while(tata[x]!=x)
{
aux=tata[x];
tata[x]=r;
x=aux;
}
return r;
}
void unite(int x, int y)
{
tata[x]=y;
}
int x,y,n,m,tip,i;
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
tata[i]=i;
}
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&tip,&x,&y);
if(tip==2)
{
if(find(x)==find(y))
printf("DA\n");
else printf("NU\n");
}
else
unite(find(x),find(y));
}
return 0;
}