Pagini recente » Cod sursa (job #3139371) | Cod sursa (job #3213810) | Cod sursa (job #1461155) | Cod sursa (job #3248407)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int nmax = 1e5 + 1;
vector <int> m[nmax];
int sz[nmax] , r[nmax] , n , q , op , a , b;
signed main()
{
cin >> n;
for(int i = 1 ; i <= n ; ++i)
{
sz[i] = 1;
r[i] = i;
m[i].push_back(i);
}
cin >> q;
for(int i = 1 ; i <= q ; ++i)
{
cin >> op >> a >> b;
if(op == 2)
{
if(r[a] == r[b]) cout << "DA\n";
else cout << "NU\n";
}
else
{
if(r[a] == r[b]) continue;
if(sz[r[a]] < sz[r[b]]) swap(a,b);
sz[r[a]] += sz[r[b]];
sz[r[b]] = 0;
int nig = r[b];
for(auto it : m[nig]) m[r[a]].push_back(it) , r[it] = r[a];
m[nig].clear();
}
}
return 0;
}