Pagini recente » Cod sursa (job #1306795) | Cod sursa (job #396917) | Cod sursa (job #1774492) | Cod sursa (job #1684153) | Cod sursa (job #1771208)
#include <iostream>
#include <cstdio>
using namespace std;
int n,m,tata[100005];
void initializare()
{
for(int i = 1 ; i <= n ; ++i)
{
tata[i] = i;
}
}
int radacina(int x)
{
while(tata[x] != x)
{
x = tata[x];
}
return x;
}
void citire()
{
scanf("%d %d\n",&n,&m);
initializare();
int tmp,x,y;
for(int i = 0 ; i < m ; ++i)
{
scanf("%d %d %d\n",&tmp,&x,&y);
if(tmp == 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();
return 0;
}