Pagini recente » Cod sursa (job #1173715) | Cod sursa (job #609787) | Cod sursa (job #2772427) | Cod sursa (job #1406508) | Cod sursa (job #2552179)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int N = 100001;
const int M = 100001;
int n,nr[N],m,cod,x,y,t[N];
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(rx == ry)
return;
if(nr[rx] < nr[ry]){
t[rx] = ry;
nr[ry] += nr[rx];
}else{
t[ry] = rx;
nr[rx] += ry;
}
}
bool interogare(int x,int y){
return(radacina(x) == radacina(y));
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++){
fin>>cod>>x>>y;
if(cod==1)
reuniune(x,y);
else{
if(interogare(x,y))
fout<<"DA"<<'\n';
else
fout<<"NU"<<'\n';
}
}
fin.close();
fout.close();
return 0;
}