Pagini recente » Cod sursa (job #406715) | Cod sursa (job #2061660) | Cod sursa (job #3041601) | Cod sursa (job #689432) | Cod sursa (job #1944224)
#include<stdio.h>
#include<iostream>
#include<vector>
#define v_i vector<int>
#define v_ip vector<int>&
using namespace std;
int n, m;
int type, x, y;
void unify(v_ip t,v_ip r, int x, int y)
{
if (r[x] > r[y])
{
t[x] = y;
}
else
{
t[y] = x;
}
if (r[x] ==r[y])
{
r[x]++;
}
}
int found(v_ip t, int x)
{
int rad = x;
int aux;
for (rad = x; rad != t[rad]; rad = t[rad]);
while (x != rad)
{
aux = t[x];
t[x] = rad;
x = aux;
}
return rad;
}
void initialize(v_ip t,v_ip r)
{
for (int i = 1; i < t.size(); i++)
{
t[i] = i;
r[i] = 1;
}
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
scanf("%d %d", &n, &m);
v_i t(n + 1);
v_i r(n + 1);
initialize(t, r);
for (int i = 1; i <= m; i++)
{
scanf("%d %d %d", &type, &x, &y);
if (type == 1)
{
unify(t, r, found(t, x), found(t, y));
}
else
{
if (found(t, x) == found(t, y))
{
printf("DA\n");
}
else
{
printf("NU\n");
}
}
}
return 0;
}