C Dijkstra+结点权值+边权值+统计边数+统计最短路径个数+保存路径 1087 All Roads Lead to Rome (30分)

最新推荐文章于 2023-02-18 00:42:31 发布

豌豆射手GCC

最新推荐文章于 2023-02-18 00:42:31 发布

阅读量327

点赞数

分类专栏：数据结构算法图

本文链接：https://blog.csdn.net/BLUEsang/article/details/105468051

版权

该博客介绍了如何运用Dijkstra算法解决从指定城市出发，寻找到达罗马的最低成本且最大幸福感的旅游路线问题。输入包含城市数量、路线总数及各城市幸福感，输出最短路径的唯一性信息及推荐路线。

摘要由CSDN通过智能技术生成

1087 All Roads Lead to Rome (30分)

Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.

Input Specification:
Each input file contains one test case. For each case, the first line contains 2 positive integers N (2≤N≤200), the number of cities, and K, the total number of routes between pairs of cities; followed by the name of the starting city. The next N−1 lines each gives the name of a city and an integer that represents the happiness one can gain from that city, except the starting city. Then K lines follow, each describes a route between two cities in the format City1 City2 Cost. Here the name of a city is a string of 3 capital English letters, and the destination is always ROM which represents Rome.

Output Specification:
For each test case, we are supposed to find the route with the least cost. If such a route is not unique, the one with the maximum happiness will be recommanded. If such a route is still not unique, then we output the one with the maximum average happiness – it is guaranteed by the judge that such a solution exists and is unique.

Hence in the first line of output, you must print 4 numbers: the number of different routes with the least cost, the cost, the happiness, and the average happiness (take the integer part only) of the recommanded route. Then in the next line, you are supposed to print the route in the format City1->City2->…->ROM.

Sample Input:

6 7 HZH
ROM 100
PKN 40
GDN 55
PRS 95
BLN 80
ROM GDN 1
BLN ROM 1
HZH PKN 1
PRS ROM 2
BLN HZH 2
PKN GDN 1
HZH PRS 1

Sample Output:

3 3 195 97
HZH->PRS->ROM

题目
结点权值：每个城市的快乐度
边权值：每条路径的花费
统计边数：统计最短路径经过的结点的个数
最短路径个数：统计最短路径有几条
保存路径：保存路径，后续输出

上述分别需要维护一个列表；

int D[MAXcity];        //最少花费
int mostHap[MAXcity];  //最多快乐度
int Count[MAXcity];   //最短路径的个数 
int C[MAXcity];      //统计路程经过的边数 
int path[MAXcity];    //记录路径

最少最短都初始化为INFINITY；
统计个数边数都初始化为0；

拓展Dijkstra算法:

void Dijkstra()
{
   
	bool visited[MAXcity];
	fill(D,D+MAXcity,INFINITY); //最短距离 
	fill(visited,visited+MAXcity,false);
	fill(mostHap,mostHap+MAXcity,0);
	fill(Count,Count+MAXcity,0);
	fill(C,C+MAXcity,0);
	
	D[0]