Pagini recente » Cod sursa (job #251069) | Cod sursa (job #902798) | Cod sursa (job #1684899) | Cod sursa (job #281288) | Cod sursa (job #1010733)
#include<cstdio>
using namespace std;
int t[100003];
int radacina(int x)
{
if (t[x]==0) return x;
int r=radacina(t[x]);
t[x]=r;
return r;
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,i,j,k,l,a,b,c;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&a,&b,&c);
if (a==2)
{
if (t[b]==t[c]) printf("DA\n");
else printf("NU\n");
}
else
{
t[radacina(c)]=radacina(b);
}
}
return 0;
}