Pagini recente » Cod sursa (job #1456373) | Cod sursa (job #3254523) | Cod sursa (job #149389) | Cod sursa (job #2383127) | Cod sursa (job #2559458)
#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int n,m,x,y,q;
int t[100005], nr[100005];
int radacina(int x){
if(t[x]==0){
return x;
}
t[x]=radacina(t[x]);
return t[x];
}
void reuniune(int x, int y){
int rx=radacina(x);
int ry=radacina(y);
if(nr[rx]<nr[ry]){
t[rx]=ry;
nr[ry]+=nr[rx];
}
else{
t[ry]=rx;
nr[rx]+=nr[ry];
}
}
bool interogare(int x, int y){
return (radacina(x)==radacina(y));
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>q>>x>>y;
if(q==1){
reuniune(x,y);
}
else{
if(interogare(x,y)){
cout<<"DA"<<'\n';
}
else{
cout<<"NU"<<'\n';
}
}
}
return 0;
}