Pagini recente » Cod sursa (job #2945038) | Cod sursa (job #2863268) | Cod sursa (job #409346) | Cod sursa (job #2122374) | Cod sursa (job #803912)
Cod sursa(job #803912)
#include<cstdio>
#define BM 100005
int mp[BM];
int a[BM],n,m;
int main () {
int i,op,x,y,j,k;
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
for(i=1;i<=n;++i)mp[i]=i;
for(i=1;i<=m;++i){
scanf("%d %d %d",&op,&x,&y);
// fprintf(stderr,"%d %d\n",mp[x],mp[y]);
if(op==1){
if(mp[x]>mp[y])mp[x]=mp[y];
else mp[y]=mp[x];
}
else{
for(j=mp[x];j!=mp[j];j=mp[j]);
for(k=mp[y];k!=mp[k];k=mp[k]);
if(j==k)printf("DA\n");
else printf("NU\n");
}
}
return 0;
}