Pagini recente » Cod sursa (job #2941780) | Cod sursa (job #2094774) | Cod sursa (job #2281881) | Cod sursa (job #1533590) | Cod sursa (job #2402578)
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define rc(s) return cout<<s,0
#define int long long
#define cin fin
#define cout fout
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,x,y,t,siz[100005],par[100005];
int finf(int x){
if(x!=par[x]) par[x]=finf(par[x]);
return par[x];
}
void add(int a,int b){
if(siz[a]<siz[b]) swap(a,b);
int x=finf(a);
int y=finf(b);
par[y]=x;
siz[x]+=siz[y];
}
void query(int a,int b){
if(finf(a)==finf(b)) cout<<"DA"<<'\n';
else cout<<"NU"<<'\n';
}
int32_t main(){
ios_base::sync_with_stdio(0);cin.tie();cout.tie();
cin >> n >> m;
for(int i=1;i<=n;i++) par[i]=i;
for(int i=1;i<=m;i++){
cin >> t >> x >> y;
if(t==1) add(x,y);
else query(x,y);
}
return 0;
}