Pagini recente » Cod sursa (job #2783661) | Cod sursa (job #3148290) | Cod sursa (job #2869093) | Cod sursa (job #38015) | Cod sursa (job #803917)
Cod sursa(job #803917)
#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){
for(j=mp[x];j!=mp[j];j=mp[j]);
for(k=mp[y];k!=mp[k];k=mp[k]);
if(j>k)mp[j]=k;
else mp[k]=j;
}
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;
}