PAT_A1087#All Roads Lead to Rome

Source:

PAT A1087 All Roads Lead to Rome (30 分)

Description:

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), 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 Klines 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

Keys:

• 最短路径

Attention:

• 结点编号从1开始，因为映射判定的条件是结点编号==0

Code:

 /*
 Data: 2019-08-27 19:12:20
 Problem: PAT_A1087#All Roads Lead to Rome
 AC: 37:38
 
 题目大意：
 从起点至终点ROM花费最少且最幸福的一条路，
 若不唯一，给出平均幸福指数最高的路径
 
 输入：
 第一行给出，城市数N，路径数K，起点城市
 接下来N-1行，城市名，幸福指数
 接下来K行，v1,v2,cost
 输出：
 最短路径数目，花费，幸福指数，平均幸福指数（整数部分,除去起点）
 起点至终点的路径
 */
 #include<cstdio>
 #include<string>
 #include<vector>
 #include<map>
 #include<iostream>
 #include<algorithm>
 using namespace std;
 const int M=1e3,INF=1e9;
 int n,m,v1,v2,t,grap[M][M],d[M],w[M],vis[M],pt=,optH=,cnt=;
 vector<int> pre[M],path,optPath;
 map<string,int> mp;
 string city[M];
 
 int ToInt(string s)
 {
     if(mp[s] == )
     {
         city[pt]=s;
         mp[s]=pt++;
     }
     return mp[s];
 }
 
 void Dijskra(int s)
 {
     fill(vis,vis+M,);
     fill(d,d+M,INF);
     d[s]=;
     for(int i=; i<=n; i++)
     {
         int u=-,Min=INF;
         for(int j=; j<=n; j++)
         {
             if(vis[j]== && d[j]<Min)
             {
                 u = j;
                 Min=d[j];
             }
         }
         if(u==-)
             break;
         vis[u]=;
         for(int v=; v<=n; v++)
         {
             if(vis[v]== && grap[u][v]!=INF)
             {
                 if(d[u]+grap[u][v]<d[v])
                 {
                     pre[v].clear();
                     pre[v].push_back(u);
                     d[v] = d[u]+grap[u][v];
                 }
                 else if(d[u]+grap[u][v]==d[v])
                     pre[v].push_back(u);
             }
         }
     }
 }
 
 void DFS(int v)
 {
     if(v == )
     {
         cnt++;
         int happy=;
         for(int i=; i<path.size(); i++)
             happy+=w[path[i]];
         if(happy > optH)
         {
             optH = happy;
             optPath = path;
         }
         else if(happy==optH && path.size()<optPath.size())
             optPath = path;
         return;
     }
     path.push_back(v);
     for(int i=; i<pre[v].size(); i++)
         DFS(pre[v][i]);
     path.pop_back();
 }
 
 int main()
 {
 #ifdef ONLINE_JUDGE
 #else
     freopen("Test.txt", "r", stdin);
 #endif // ONLINE_JUDGE
 
     string s1,s2;
     cin >> n >> m >> s1;
     ToInt(s1);
     for(int i=; i<n; i++)
     {
         cin >> s1;
         v1 = ToInt(s1);
         scanf("%d", &w[v1]);
         if(s1 == "ROM")
             t = v1;
     }
     fill(grap[],grap[]+M*M,INF);
     for(int i=; i<m; i++)
     {
         cin >> s1 >> s2;
         v1 = ToInt(s1);
         v2 = ToInt(s2);
         scanf("%d", &grap[v1][v2]);
         grap[v2][v1]=grap[v1][v2];
     }
     Dijskra();
     DFS(t);
     printf("%d %d %d %d\n", cnt,d[t],optH,optH/optPath.size());
     printf("%s", city[].c_str());
     for(int i=optPath.size()-; i>=; i--)
         printf("->%s", city[optPath[i]].c_str());
 
     return ;
 }