[PAT]Emergency (25)@Java

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible. 

输入描述:

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) - the number of cities (and the cities are numbered from 0 to N-1), M - the number of roads, C1 and C2 - the cities that you are currently in and that you must save, respectively.  The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city.  Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively.  
It is guaranteed that there exists at least one path from C1 to C2.

输出描述:

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.

All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

示例1

输入

5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

输出

2 4

package go.jacob.day824;

import java.util.Scanner;

/**
 * Emergency (25)
 * 
 * @author Administrator 通过率只有80%
 */
public class Demo3 {
	static int[][] map; // 邻接矩阵，存储所有边
	static boolean[] visited; // 标志一个城市是否已经被访问
	static int[] dist; // 记录从起点到某点的距离。初始化为Integer.MAX_VALUE
	static int[] cityTeams;// 记录每个城市的救援队数量
	static int maxTeams;// 记录到达每个城市最大救援队数量
	static int count; // 记录最短路径数
	static int source;// 起点
	static int dest;// 重点
	static int cityNum;// 城市数量

	public static void main(String[] args) {
		// 初始化
		Scanner sc = new Scanner(System.in);
		cityNum = sc.nextInt();
		int edgeNum = sc.nextInt();
		source = sc.nextInt();
		dest = sc.nextInt();

		map = new int[cityNum][cityNum];
		visited = new boolean[cityNum];
		dist = new int[cityNum];
		cityTeams = new int[cityNum];
		for (int i = 0; i < cityNum; i++) {
			cityTeams[i] = sc.nextInt();
		}
		for (int i = 0; i < cityNum; i++) {
			dist[i] = Integer.MAX_VALUE;
			for (int j = 0; j < cityNum; j++) {
				if (i == j)
					map[i][i] = 0;
				else
					map[i][j] = Integer.MAX_VALUE;
			}
		}
		// 边初始化
		for (int i = 0; i < edgeNum; i++) {
			int a = sc.nextInt(), b = sc.nextInt(), L = sc.nextInt();
			map[a][b] = L;
			map[b][a] = L;
		}
		sc.close();
		dijkstra(source, dest, cityNum);
		for (int i = 0; i < cityNum; i++)
			visited[i] = false;
		dfs(source, cityTeams[source]);
		System.out.println(count + " " + maxTeams);
	}

	private static void dfs(int s, int teamNum) {
		if (s == dest) {
			if (teamNum > maxTeams)
				maxTeams = teamNum;
			count++;
			return;
		}
		visited[s] = true;
		for (int i = 0; i < cityNum; i++) {
			if (!visited[i] && dist[i] == dist[s] + map[s][i]) {
				visited[i] = true;
				dfs(i, teamNum + cityTeams[i]);
				visited[i] = false;
			}
		}
	}

	private static void dijkstra(int source, int dest, int cityNum) {
		// dest = 3;
		dist[source] = 0;
		int curNode = source;
		while (true) {
			// 把当前点加入已遍历集合
			if (curNode == -1)
				break;
			visited[curNode] = true;
			for (int i = 0; i < cityNum; i++) {
				// (map[curNode][i] + dist[curNode] < dist[i])会溢出
				if (!visited[i] && map[curNode][i] <= dist[i] - dist[curNode]) {
					dist[i] = map[curNode][i] + dist[curNode];
				}
			}
			int min = Integer.MAX_VALUE, index = -1;
			// 找到当前未放入已遍历集合的路径最小值
			for (int i = 0; i < cityNum; i++) {
				if (!visited[i] && dist[i] < min) {
					// 如果最小值更新，计数器从0开始重新计数
					min = dist[i];
					index = i;
				}
			}
			curNode = index;
		}
	}
}