Pagini recente » Cod sursa (job #376941) | Cod sursa (job #420535) | Cod sursa (job #2849696) | Cod sursa (job #2911848) | Cod sursa (job #2354646)
#include<iostream>
#include<stdio.h>
#include<fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int v[100000];
int boss(int x){
if(v[x]==x)
return x;
return v[x]=boss(v[x]);
}
int unire(int x,int y){
int xmax,ymax;
xmax=boss(x);
ymax=boss(y);
v[xmax]=ymax;
}
int main() {
///freopen("disjoint.in","r",stdin);
///freopen("disjoint.out","w",stdout);
int n,m,i,cer,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=m;i++){
in>>cer>>x>>y;
if(cer==1)
unire(x,y);
else{
if(boss(x)==boss(y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
}
return 0;
}