1087 All Roads Lead to Rome（30 分）

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

做的过程中有个坑过不去，上网搜了一下题解 发现 全是用Dijkstra最短路径 做的，但是这题我还是觉得更符合dfs的思路

所以就做下去了 成功AC，坑也是小坑 就是 相同的最便宜的路径个数 。 果然还是坚持自己的想法更好。 

#pragma warning(disable:4996)
#include <iostream>
#include <string>
#include <map>
#include <vector>
#define inf 0x7fffffff
using namespace std;
int graph[210][210];
int viscity[210];
int cityhappy[210];
map<string, int> cityno;
vector<string> nocity;
vector<int> road;
int least_cost = 0x7fffffff,maxhappy = -1,maxaverhappy = -1;
int num = 0;
vector<int> recomroad;
void dfs(int pos, int happy ,int cost);
void init();
int n, k;
string start_city;
int main() {
	cin >> n >> k >> start_city;
	cityno[start_city] = 0;
	nocity.push_back(start_city);
	string city, ancity;
	int happy;
	init();
	for (int i = 1; i < n; ++i) {
		cin >> city >> happy;
		cityno[city] = i;
		nocity.push_back(city);
		cityhappy[i] = happy;
	}
	for (int i = 0; i < k; ++i) {
		cin >> city >> ancity >> happy;	
		graph[cityno[city]][cityno[ancity]] = happy;
		graph[cityno[ancity]][cityno[city]] = happy;
	}
	dfs(0, 0, 0);
	cout << num << ' ' << least_cost << ' ' << maxhappy << ' ' << maxaverhappy << endl;
	for (int i = 0; i < recomroad.size(); ++i) {
		if (i != 0) cout << "->";
		cout << nocity[recomroad[i]];
	}
	system("pause");
	return 0;
}
void dfs(int pos,int happy, int cost){
	viscity[pos] = 1;
	road.push_back(pos);
	if (pos == cityno["ROM"]) {
		if (least_cost >= cost) {
			if (least_cost > cost) num = 0;
			num++;
			int avg = happy / (road.size() - 1);
			if (least_cost>cost || least_cost == cost && maxhappy < happy || least_cost == cost && maxhappy == happy && maxaverhappy < avg) {
				least_cost = cost;
				maxhappy = happy;
				maxaverhappy = avg;
				recomroad = road;
			}
		}
		road.pop_back();
		viscity[pos] = 0;
		return;
	}
	for (int i = 1; i < n; ++i) {
		if (viscity[i] == 0 && graph[pos][i] != inf) {
			dfs(i,happy+cityhappy[i], cost + graph[pos][i]);
		}
	}
	road.pop_back();
	viscity[pos] = 0;
}