Pagini recente » Cod sursa (job #1962192) | Cod sursa (job #2198768) | Cod sursa (job #2332948) | Cod sursa (job #2147987) | Cod sursa (job #1581747)
#include <cstdio>
#define NMax 1000053
using namespace std;
int root[NMax];
int x,y,n,m,p;
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i = 1; i <= m; ++i){
scanf("%d%d%d",&p,&x,&y);
int w = y;
while(root[w] != 0)
w = root[w];
int t = x;
while(root[t] != 0)
t = root[t];
if(p == 1){
root[t] = w;
}else{
if(t != w){
printf("NU\n");
}else
printf("DA\n");
}
}
return 0;
}