Pagini recente » Cod sursa (job #787192) | Cod sursa (job #2035264) | Cod sursa (job #1113611) | Cod sursa (job #2616014) | Cod sursa (job #2809741)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m;
int tata[100009], lung_max[100009];
int radacina(int x)
{
if(tata[x]==x)
{
return x;
}
tata[x]=radacina(tata[x]);
return tata[x];
}
void unire(int x, int y)
{
int rad_x=radacina(x);
int rad_y=radacina(y);
if(lung_max[rad_x]>lung_max[rad_y])
{
tata[rad_y]=rad_x;
}
else if(lung_max[rad_x]<lung_max[rad_y])
{
tata[rad_x]=rad_y;
}
else
{
tata[rad_y]=rad_x;
lung_max[rad_x]+=1;
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
tata[i]=i;
lung_max[i]=1;
}
for(int i=1;i<=m;i++)
{
int op;
int x, y;
fin>>op>>x>>y;
if(op==1)
{
unire(x,y);
}
else
{
if(radacina(x)==radacina(y))
{
fout<<"DA"<<'\n';
}
else
fout<<"NU\n";
}
}
return 0;
}