Pagini recente » Cod sursa (job #1400084) | Cod sursa (job #282512) | Cod sursa (job #1924172) | Cod sursa (job #2600389) | Cod sursa (job #948798)
Cod sursa(job #948798)
#include<fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,n,m,op,x,y,t[1001000],rang[100100];
int gaseste(int x)
{
int z,y;
for(y=x;y!=t[y];y=t[y]);
for(;t[x]!=x;)
{
z=t[x];
t[x]=y;
x=z;
}
return y;
}
void uneste(int x,int y)
{
if(rang[x]>rang[y])
{
t[y]=x;
}
else
t[x]=y;
if(rang[x]==rang[y])
++rang[y];
}
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
{
rang[i]=1;
t[i]=i;
}
for(i=1;i<=m;++i)
{
f>>op>>x>>y;
if(op==1)
{
uneste(gaseste(x),gaseste(y));
}
else
{
if(gaseste(x)==gaseste(y))
{
g<<"DA\n";
}
else
{
g<<"NU\n";
}
}
}
return 0;
}