Pagini recente » Cod sursa (job #2241384) | Cod sursa (job #2358092) | Cod sursa (job #848212) | Cod sursa (job #1666851) | Cod sursa (job #238909)
Cod sursa(job #238909)
#include<stdio.h>
#define nmax 100004
int rg[nmax],fej[nmax];
int go(int x)
{
int r,y;
for (r=x;fej[r]!=r;++r)
;
for ( ;fej[x]!=r; )
{
y=fej[x];
fej[x]=r;
x=y;
}
return r;
}
void egyesit(int x,int y)
{
if (rg[x]>rg[y])
fej[y]=x;
else
fej[x]=y;
if (rg[x]==rg[y])
rg[y]++;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,cod,x,y,i;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
{
rg[i]=1;
fej[i]=i;
}
for (i=1;i<=m;i++)
{
scanf("%d%d%d",&cod,&x,&y);
if (cod==2)
{
if (go(x)==go(y))
printf("DA\n");
else
printf("NU\n");
}
else
egyesit(go(x),go(y));
}
return 0;
}