Pagini recente » Cod sursa (job #1237309) | Cod sursa (job #2908136) | Cod sursa (job #483995) | Cod sursa (job #922023) | Cod sursa (job #1944184)
#include<cstdio>
int i,n, m, t[100010], r[100010];
int gas( int x)
{
int rad;
for (rad = x; rad != t[rad]; rad = t[rad]);
while (x != t[x])
{
int aux = t[x];
t[x] = rad;
x = aux;
}
return rad;
}
void unifeste(int x, int y)
{
if (r[x] < r[y])
{
t[x] = y;
}
else
{
t[y] = x;
}
if (r[x] == r[y])
{
r[x]++;
}
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i)
{
t[i] = i;
r[i] = 1;
}
for (int i = 1; i <= m; i++)
{
int tip,x,y;
scanf("%d %d %d", &tip, &x, &y);
if (tip == 1)
{
unifeste( x, y);
}
else
{
if (gas( x) == gas( y))
{
printf("DA\n");
}
else
{
printf("NU\n");
}
}
}
fclose(stdin);
fclose(stdout);
return 0;
}