Pagini recente » Cod sursa (job #2295930) | Cod sursa (job #2710149) | Cod sursa (job #670494) | Cod sursa (job #2429176) | Cod sursa (job #3251288)
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int sef[100005],sef1,sef2;
int sef_suprem(int x)
{
if(sef[x]==x)
return x;
else{
return sef[x]=sef_suprem(sef[x]);
}
}
void unire(int x,int y){
sef1=sef_suprem(x);
sef2=sef_suprem(y);
sef[sef1]=sef2;
}
int main()
{
int n,i,x,y,m,c;
fin>>n>>m;
for(i=1;i<=n;i++)
sef[i]=i;
for(i=1;i<=m;i++)
{
fin>>c>>x>>y;
if(c==1)
{
//if(sef_suprem(x)==sef_suprem(y))
unire(x,y);
}
else
{
if(sef_suprem(x)==sef_suprem(y))
fout<<"DA\n";
else
fout<<"NU\n";
}
}
return 0;
}