Pagini recente » Cod sursa (job #2323279) | Cod sursa (job #2295352) | Cod sursa (job #2329926) | Cod sursa (job #1859228) | Cod sursa (job #2050463)
#include <cstdio>
int n,m,i,op,x,y,r1,r2,t[100005];
int radacina(int x)
{
if (t[x]==x) return x;
else return t[x]=radacina(t[x]);
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1; i<=n; i++)
t[i]=i;
for (i=1; i<=m; i++)
{
scanf("%d%d%d",&op,&x,&y);
if (op==1)
{
r1=radacina(x);
r2=radacina(y);
if (r1!=r2)
{
if (r1<r2) t[r2]=r1;
else if (r2<r1) t[r1]=r2;
}
}
else
{
r1=radacina(x);
r2=radacina(y);
if (r1==r2) printf("DA\n");
else printf("NU\n");
}
}
return 0;
}