Pagini recente » Cod sursa (job #2113668) | Cod sursa (job #632767) | Cod sursa (job #1473031) | Cod sursa (job #1596159) | Cod sursa (job #2772215)
#include<fstream>
using namespace std;
#define MAXN 100001
int dad[MAXN];
int find_daddy(int x){
if(x==dad[x])
return x;
return dad[x]=find_daddy(dad[x]);
}
inline void join(int x, int y){
int rx, ry;
rx=find_daddy(x);
ry=find_daddy(y);
dad[ry]=rx;
}
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int main(){
int n, i, tip, x, y, m, a, b;
cin>>n>>m;
for(i=1; i<=n; i++)
dad[i]=i;
for(i=1; i<=m; i++){
cin>>tip>>x>>y;
if(tip==1)
join(x, y);
else{
a=find_daddy(x);
b=find_daddy(y);
if(a==b)
cout<<"DA\n";
else
cout<<"NU\n";
}
}
return 0;
}