Pagini recente » Cod sursa (job #1786011) | Cod sursa (job #2236401) | Cod sursa (job #1841157) | Cod sursa (job #2819287) | Cod sursa (job #2547362)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
const int N=100001;
int n,m, nr[N], t[N], c;
int radacina(int x)
{
if(t[x]==0)
return x;
t[x]=radacina(t[x]);
return t[x];
//de fraieri:
//return radacina(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]+=nr[ry];
}
}
bool interogare(int x, int y)
{
return (radacina(x)==radacina(y));
}
int main()
{
in>>n>>m;
for(int i=1; i<=n; i++)
nr[i]=1;
for(int i=1; i<=m; i++)
{
int x, y;
in>>c>>x>>y;
if(c==1)
reuniune(x,y);
else if(c==2)
{
if(interogare(x,y)==true)
out<<"DA";
else
out<<"NU";
}
}
return 0;
}