Pagini recente » Cod sursa (job #1242898) | Cod sursa (job #2657659) | Cod sursa (job #2176036) | Cod sursa (job #950114) | Cod sursa (job #1109993)
#include <cstdio>
#define Nmax 100005
int N, M, T[Nmax];
void Citire()
{
scanf("%d %d", &N, &M);
for (int i = 1; i <= N; ++i)
T[i] = i;
}
int Caut_Tata(int nod)
{
if (T[nod] != nod)
T[nod] = Caut_Tata(T[nod]);
return T[nod];
}
void Operatii()
{
int op, a, b;
for (int i = 1; i <= M; ++i)
{
scanf("%d %d %d", &op, &a, &b);
T[a] = Caut_Tata(a);
T[b] = Caut_Tata(b);
if (op == 1)
T[T[b]] = T[a];
else if (T[a] == T[b])
printf("DA\n");
else
printf("NU\n");
}
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
Citire();
Operatii();
return 0;
}