Pagini recente » Cod sursa (job #2217583) | Cod sursa (job #948496) | Cod sursa (job #2723237) | Cod sursa (job #652936) | Cod sursa (job #3268444)
#include<bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
int n, m, ans[NMAX], s, tata[NMAX], rang[NMAX];
void unite(int a, int b)
{
while(a != tata[a])
a = tata[a];
while(b != tata[b])
b = tata[b];
if(rang[a] < rang[b])
{
rang[b] = rang[a];
tata[a] = b;
}
else
{
rang[a] += rang[b];
tata[b] = a;
}
}
void check(int a, int b)
{
while(a != tata[a])
a = tata[a];
while(b != tata[b])
b = tata[b];
if(tata[a] == tata[b])
cout << "DA\n";
else
cout << "NU\n";
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
freopen("disjoint.in", "r", stdin);
freopen("disjoint.out", "w", stdout);
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
tata[i] = i;
rang[i] = 1;
}
int c, a, b;
for(int i = 1; i <= m; i++)
{
cin >> c >> a >> b;
if(c == 1)
unite(a, b);
else
check(a, b);
}
}