Pagini recente » Cod sursa (job #762611) | Cod sursa (job #3185452) | Cod sursa (job #3187623) | Cod sursa (job #2315498) | Cod sursa (job #1075193)
//horatiu11
# include <cstdio>
# define nmax 100001
using namespace std;
int T[nmax],n,m,op,x,y;
inline int father(int x)
{
if(T[x]!=x)T[x]=father(T[x]);
return T[x];
}
inline void unific(int x,int y)
{
T[y]=x;
}
int main()
{
int i;
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);
switch(op)
{
case 1:
unific(father(x),father(y));
break;
case 2:
if(father(x)==father(y))printf("DA\n");
else printf("NU\n");
break;
}
}
return 0;
}