Pagini recente » Cod sursa (job #2467992) | Cod sursa (job #885637) | Cod sursa (job #1157271) | Cod sursa (job #1369635) | Cod sursa (job #1608318)
#include <iostream>
#include <stdio.h>
using namespace std;
int tata[100010],n,m;
int parinte(int k)
{
if(tata[k]==k)
return k;
return tata[k]=parinte(tata[k]);
}
void citire()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
tata[i]=i;
for(int i=0;i<m;i++)
{
int x,a,b;
scanf("%d %d %d",&x,&a,&b);
if(x==1)
if(parinte(a)!=parinte(b))
tata[parinte(a)]=parinte(b);
if(x==2)
if(parinte(a)==parinte(b))
printf("DA\n");
else
printf("NU\n");
}
}
int main()
{
citire();
return 0;
}