Pagini recente » Cod sursa (job #1276351) | Cod sursa (job #2631274) | Cod sursa (job #851229) | Cod sursa (job #1866768) | Cod sursa (job #1771224)
#include <iostream>
#include <cstdio>
using namespace std;
const int Nmax=200005;
int n,m,tata[Nmax];
int radacina(int x)
{
while(x!=tata[x])
x=tata[x];
return x;
}
void citire()
{
scanf("%d%d",&n,&m);
int cerinta;
for(int i=1;i<=n;i++)
{
tata[i]=i;
}
for(int i=1;i<=m;i++)
{
int x,y;
scanf("%d%d%d",&cerinta,&x,&y);
if(cerinta==1)
{
tata[radacina(y)]=radacina(x);
}
else
{
if(radacina(x)==radacina(y))
printf("DA\n");
else
printf("NU\n");
}
}
}
int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
citire();
//cout << "Hello world!" << endl;
return 0;
}