Pagini recente » Cod sursa (job #2031689) | Cod sursa (job #937794) | Cod sursa (job #139613) | Cod sursa (job #1598913) | Cod sursa (job #1053258)
#include<cstdio>
using namespace std;
int N,M,Father[100005],C,X,Y,i;
int Find(int X)
{
if(Father[X]==X) return Father[X];
Father[X]=Find(Father[X]);
}
void Unite(int X,int Y)
{
Father[Y]=X;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++) Father[i]=i;
for(;M;M--)
{
scanf("%d%d%d",&C,&X,&Y);
if(C==1) Unite(Find(X),Find(Y));
else {if(Find(X)==Find(Y)) printf("DA\n"); else printf("NU\n");}
}
return 0;
}