Pagini recente » Cod sursa (job #1947527) | Cod sursa (job #2146742) | Cod sursa (job #1448924) | Cod sursa (job #602643) | Cod sursa (job #2030180)
#include <cstdio>
using namespace std;
int v[100005];
int tata(int f)
{
int ff=f;
while(f!=v[f])
f=v[f];
int tmp;
while(ff!=f)
{
tmp=v[ff];
v[ff]=f;
ff=tmp;
}
return f;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,q,x,y,p;
scanf("%d %d",&n,&q);
for(int i=1;i<=n;++i)
v[i]=i;
for(int i=1;i<=q;++i)
{
scanf("%d",&p);
scanf("%d %d",&x,&y);
if(p==1)
{
v[tata(x)]=tata(y);
}
else
{
if(tata(x)==tata(y))
printf("DA\n");
else
printf("NU\n");
}
}
return 0;
}