Pagini recente » Cod sursa (job #813023) | Cod sursa (job #486216) | Cod sursa (job #3165681) | Cod sursa (job #1157188) | Cod sursa (job #1944177)
#include<stdio.h>
#include<iostream>
#include<vector>
#define v_i vector<int>
#define v_ip int*
using namespace std;
int n, m;
int type, x, y;
int t[100010], r[100010];
void unify(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( 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;
}
int main()
{
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
scanf("%d %d", &n, &m);
////v_i t(100010);
//v_i r(100010);
for (int i = 1; i <= n; ++i)
{
t[i] = i;
r[i] = 1;
}
for (int i = 1; i <= m; i++)
{
int tip;
scanf("%d%d%d", &tip, &x, &y);
if (tip == 1)
{
unify( x, y);
}
else
{
if (found( x) == found( y))
{
printf("DA\n");
}
else
{
printf("NU\n");
}
}
}
fclose(stdin);
fclose(stdout);
return 0;
}