Pagini recente » Cod sursa (job #2665628) | Cod sursa (job #2785127) | Cod sursa (job #1897621) | Cod sursa (job #2810831) | Cod sursa (job #662098)
Cod sursa(job #662098)
#include<fstream>
#include<iostream>
#include<stdlib.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
//se merge in spate pana se ajunge la tatal initial
int find_r(int *v,int x)
{
if(x==v[x])
return x;
v[x]=find_r(v,v[x]);
return v[x];
}
int main()
{
int *v,n,i,m,j,op,x,y,rad_x,rad_y;
in>>n;
//alocarea vectorului
v=( int *)malloc((n+1)*sizeof( int ));
//padurea disjuncta
for(i=1;i<=n;i++)
v[i]=i;
in>>m;
for(j=1;j<=m;j++)
{
in>>op;
in>>x>>y;
rad_x=find_r(v,x);
rad_y=find_r(v,y);
if(op==1)
v[rad_x]=rad_y;
else
{
if(rad_x==rad_y)
out<<"DA"<<"\n";
else
out<<"NU"<<"\n";
}
}
free(v);
in.close();
out.close();
return 0;
}