Pagini recente » Cod sursa (job #1218912) | Cod sursa (job #1219240) | Profil VladPislaru | Monitorul de evaluare | Cod sursa (job #1815788)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int N = 100001;
int t[N], v[1], h[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), ry = radacina(y);
if(h[rx]<h[ry])
t[rx] = ry;
else if(h[rx]>h[ry])
t[ry] = rx;
else{
t[rx] = ry;
h[ry]++;
}
}
bool verific(int x, int y){
return(radacina(x) == radacina(y));
}
int main()
{
int op,n,m,i,x,y;
in>>n>>m;
for(i=1;i<=n;i++)
v[i] = i;
for(i=1;i<=m;i++){
in>>op>>x>>y;
if(op == 1)
reuniune(v[x], v[y]);
else
if( verific(v[x],v[y]) )
out<<"DA \n";
else
out<<"NU \n";
}
return 0;
}