Pagini recente » Cod sursa (job #2144485) | Cod sursa (job #1199834) | Cod sursa (job #593926) | Cod sursa (job #2848092) | Cod sursa (job #2137115)
#include<bits/stdc++.h>
using namespace std;
int P[100010];
int n,m,c;
int find(int i) {
if (P[i]==i) return i;
else {
return find(P[i]);
}
}
void unit(int x, int y) {
if (P[y]==y) {
P[y]=x;
} else {
unit(x,P[y]);
P[y]=x;
}
}
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
cin>>n>>m;
for (int i=1; i<=n; i++) P[i]=i;
for (int i=1; i<=m; i++) {
int x,y;
cin>>c>>x>>y;
if (c==1) {
unit(x,y);
} else {
int a,b;
a=find(x);
b=find(y);
if (b==a) cout<<"DA\n";
else cout<<"NU\n";
}
}
return 0;
}