Mai intai trebuie sa te autentifici.
Cod sursa(job #1813142)
Utilizator | Data | 22 noiembrie 2016 18:54:46 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.28 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
int m,start[200002],i,n,vmin,j,k,
T[3][800002],c,x,y,d[200002],viz[200002],
tata[200002],infinit=2000000000;
int main()
{
fin>>n>>m;
k=0;
for(i=1;i<=m;i++)
{
fin>>x>>y>>c;
k++;
T[0][k]=y;
T[1][k]=c;
T[2][k]=start[x];
start[x]=k;
k++;
T[0][k]=x;
T[1][k]=c;
T[2][k]=start[y];
start[y]=k;
}
for(i=1;i<=n;i++)
{
viz[i]=0;
d[i]=infinit;
tata[i]=0;
}
d[1]=0;
tata[1]=0;
int s=0;
for(i=1;i<=n;i++)
{
vmin=infinit;
for(j=1;j<=n;j++)
{
if(viz[j]==0 && d[j]<vmin)
{
vmin=d[j];
k=j;
}
}
viz[k]=1;
s=s+vmin;
for(j=start[k];j!=0;j=T[2][j])
{
y=T[0][j];
c=T[1][j];
if(c<d[y])
{
d[y]=c;
tata[y]=k;
}
}
}
fout<<s<<"\n";
fout<<n-1<<"\n";
for(i=2;i<=n;i++)
{
fout<<i<<" "<<tata[i]<<"\n";
}
return 0;
}