Pagini recente » Cod sursa (job #2717837) | Cod sursa (job #1859698) | Cod sursa (job #2031549) | Cod sursa (job #1133600) | Cod sursa (job #2702538)
#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double
vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}
const int NMAX = 200005;
struct node
{
int data;
node *next;
};
vector<node> pointers(NMAX);
vector<int> size(NMAX);
void initializedsu(vector<int> &a)
{
int n = a.size();
for(int i = 0; i < n; i++)
{
node *tmp = new node;
tmp->data = a[i];
tmp->next = tmp;
pointers[a[i]] = *tmp;
size[a[i]] = 1;
}
}
int find(int x)
{
node *now = pointers[x].next;
vint path;
path.pb(x);
while(true)
{
if(now->next == now)
{
break;
}
path.pb(now->data);
now = now->next;
}
for(int i = 0; i < path.size(); i++)
{
pointers[path[i]].next = now;
}
return now->data;
}
void unite(int x, int y)
{
int leaderx = find(x);
int leadery = find(y);
if(size[leaderx] >= size[leadery])
{
pointers[leadery].next = &pointers[leaderx];
size[leaderx]+=size[leadery];
}
if(size[leadery] > size[leaderx])
{
pointers[leaderx].next = &pointers[leadery];
size[leadery]+=size[leaderx];
}
}
int32_t main(){
startt;
//freopen("aib.in", "r", stdin);
//freopen("aib.out", "w", stdout);
int n, m;
cin >> n >> m;
vint a;
for(int i = 1; i <= n; i++)
{
a.pb(i);
}
initializedsu(a);
for(int i = 0; i < m; i++)
{
int c;
cin >> c;
int x, y;
cin >> x >> y;
if(c == 1)
{
unite(x, y);
}
else
{
if(find(x) == find(y))
{
cout << "DA" << endl;
}
else
{
cout << "NU" << endl;
}
}
}
}