Pagini recente » Cod sursa (job #2226486) | Cod sursa (job #2749908) | Cod sursa (job #1817622) | Cod sursa (job #2413855) | Cod sursa (job #2759074)
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#define N 100001
int t[N], nr[N];
int radacina(int x)
{
if (t[x] == 0)
{
return x;
}
//return radacina(t[x]);
t[x] = radacina(t[x]);
return t[x];
}
void reuniune(int x, int y)
{
int rx = radacina(x);
int ry = radacina(y);
if (nr[rx] < nr[ry])
{
t[rx] = ry;
nr[ry] += nr[rx];
}
else
{
t[ry] = rx;
nr[rx] += nr[ry];
}
}
bool aceeasi_multime(int x, int y)
{
return (radacina(x) == radacina(y));
}
int main()
{
FILE *in, *out;
in = fopen("disjoint.in", "r");
out = fopen("disjoint.out", "w");
int n, m, i;
fscanf(in, "%d%d", &n, &m);
for (i = 1; i <= n; i++)
{
nr[i] = 1;
}
for (i = 0; i < m; i++)
{
int tip, x, y;
fscanf(in, "%d%d%d", &tip, &x, &y);
if (tip == 1)
{
reuniune(x, y);
}
else
{
if (aceeasi_multime(x, y))
{
fprintf(out, "DA\n");
}
else
{
fprintf(out, "NU\n");
}
}
}
fclose(in);
fclose(out);
return 0;
}