Pagini recente » Rezultatele filtrării | Cod sursa (job #2752344)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int v[100001],nr[100001];
int radacina(int x)
{
if(v[x]==0)
return x;
return radacina(v[x]);
}
bool verificare(int x, int y)
{
return (radacina(x)==radacina(y));
}
void reuniune(int x, int y)
{
int rx=radacina(x);
int ry=radacina(y);
if(nr[rx]<nr[ry]){
v[rx]=ry;
nr[ry]+=nr[rx];
}
else{
v[ry]=rx;
nr[rx]+=nr[ry];
}
}
int main()
{
int n,m;
in>>n>>m;
for(int i=0;i<m;i++){
int cod,x,y;
in>>cod>>x>>y;
if(cod==1)
reuniune(x,y);
else
if(verificare(x,y))
out<<"DA"<<'\n';
else
out<<"NU"<<'\n';
}
return 0;
}