Pagini recente » Rating Husanu Diana Maria (dianahusanu925) | Cod sursa (job #1329022) | Cod sursa (job #2198423) | Cod sursa (job #1141125) | Cod sursa (job #1669509)
#include <fstream>
#include <vector>
#define NMAX 200001
#define INFINIT 999999999
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct vf
{
int ext;
double c;
};
vector<vf> g[NMAX];
int d[NMAX],n,m,start=1,cmin[NMAX],pre[NMAX],sel[NMAX],cost;
void citire();
void initializare();
void prim();
void afisare();
int main()
{
citire();
initializare();
prim();
afisare();
fin.close();
fout.close();
return 0;
}
void citire()
{
int x,y,c,i;
vf aux;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y>>c;
aux.ext=y; aux.c=c;
g[x].push_back(aux);
aux.ext=x;
g[y].push_back(aux);
}
}
void initializare()
{
int i;
for(i=1;i<=n;i++)
{
cmin[i]=INFINIT;
pre[i]=start;
}
cmin[start]=pre[start]=0;
for(i=0;i<g[start].size();i++)
cmin[g[start][i].ext]=g[start][i].c;
sel[start]=1;
}
void prim()
{
int nr=n-1,vfmin,i,minim;
while(nr>0)
{
minim=INFINIT;
for(i=1;i<=n;i++)
{
if(cmin[i]<minim && !sel[i])
{
minim=cmin[i];
vfmin=i;
}
}
sel[vfmin]=1;
--nr;
for(i=0;i<g[vfmin].size();i++)
{
if(g[vfmin][i].c<cmin[g[vfmin][i].ext] && !sel[g[vfmin][i].ext])
{
cmin[g[vfmin][i].ext]=g[vfmin][i].c;
pre[g[vfmin][i].ext]=vfmin;
}
}
}
}
void afisare ()
{
int i;
for (i=1;i<=n;i++)
cost+=cmin[i];
fout<<cost<<'\n'<<n-1<<'\n';
for(i=1;i<=n;i++)
{
if(i!=start)
fout<<pre[i]<<' '<<i<<'\n';
}
}