没啥意思这种题,就是练习下prim的模板。
#include<iostream>
#include<map>#include<string>
using namespace std;
double cap;
int n,m;
map<string ,int> mymap;
const double inf =99999999.0;
const int N=999;
double mat[N][N];
double key[N];
int k;
int pre[N];
bool visit[N];
void prim()
{
double ans=0;
for(int i=1;i<=n;i++)
key[i]=mat[1][i],pre[i]=1;
visit[1]=true;
for(int i=1;i<n;i++)
{
double min=inf;
for(int j=1;j<=n;j++)
{
if(!visit[j]&&min>key[j])
{
min=key[j];
k=j;
}
}
visit[k]=true;
ans+=min;
for(int j=1;j<=n;j++)
{
if(!visit[j]&&key[j]>mat[k][j])
pre[j]=k,key[j]=mat[k][j];
}
}
if(ans<=cap)
printf("Need %.1lf miles of cable\n",ans);
else
printf("Not enough cable\n");
}
int main()
{
scanf("%lf",&cap);
scanf("%d",&n);
char name[22];
for(int i=1;i<=n;i++)
{
scanf("%s",name);
mymap[string(name)]=i;
}
scanf("%d",&m);
int a,b;
double c;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
mat[i][j]=inf;
for(int i=1;i<=m;i++)
{
scanf("%s",name);
a=mymap[string(name)];
scanf("%s",name);
b=mymap[string(name)];
scanf("%lf",&c);
mat[a][b]=mat[b][a]=c;
}
prim();
return 0;
}