Pagini recente » Cod sursa (job #359986) | Cod sursa (job #1228827) | Cod sursa (job #1092563) | Cod sursa (job #208223) | Cod sursa (job #2721751)
#include <fstream>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int t[100001],rang[100001];
int radacina(int x)
{
if(t[x]==0)
return x;
else return t[x]=radacina(t[x]);
}
void uniune(int x, int y)
{
int rx = radacina(x), ry = radacina(y);
if(rx != ry)
{
if(rang[rx] > rang[ry])
t[ry] = rx;
else
{
t[rx] = ry;
if(rang[rx] == rang[ry])
rang[ry] ++;
}
}
}
bool colegi(int x, int y)
{
if(radacina(x)==radacina(y))
return 1;
return 0;
}
int main()
{
int n,m,x,y,op;
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>op>>x>>y;
if(op==1)
uniune(x,y);
else
{
if(colegi(x,y))
out<<"DA"<<endl;
else out<<"NU"<<endl;
}
}
return 0;
}