Pagini recente » Cod sursa (job #2471795) | Cod sursa (job #288200) | Cod sursa (job #2517686) | Cod sursa (job #1493183) | Cod sursa (job #2414687)
#include <iostream>
#include <cstdio>
using namespace std;
int v[100001];
int Find(int x) {
if(x==v[x])
return x;
v[x]=Find(v[x]);
return v[x];
}
void Unite(int x,int y) {
v[Find(x)]=Find(y);
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,i,tip,x,y;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=m;i++) {
scanf("%d%d%d",&tip,&x,&y);
if(tip==1) {
Unite(x,y);
} else {
if(Find(x)==Find(y))
cout<<"DA\n";
else
cout<<"NU\n";
}
}
return 0;
}