Pagini recente » Cod sursa (job #2463770) | Cod sursa (job #1912792) | Cod sursa (job #3280660) | Cod sursa (job #2027734) | Cod sursa (job #1770603)
#include <iostream>
#include <cstdio>
using namespace std;
int n, m, t[100005];
void citire()
{
scanf("%d %d", &n, &m);
for(int i=1; i<=n; ++i)
t[i]=i;
}
int radacina(int x)
{
while(x!=t[x])
{
x=t[x];
}
return x;
}
void reunireMultimi(int x, int y)
{
t[radacina(y)]=radacina(x);
}
int verificareMultime(int x, int y)
{
if(radacina(x)==radacina(y))
return 1;
return 0;
}
void rezolvare()
{
int cod, x, y;
for(int i=1; i<=m; ++i)
{
scanf("%d %d %d", &cod, &x, &y);
if(cod==1)
{
reunireMultimi(x, y);
}
else
{
if(verificareMultime(x, y))
printf("DA\n");
else
printf("NU\n");
}
}
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
citire();
rezolvare();
return 0;
}