PAT 1003. Emergency (25)

http://pat.zju.edu.cn/contests/pat-a-practise/1003

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.

Input

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.

Output

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.

Sample Input

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

Sample Output

2 4

dijkstra解法：

#include <cstdio>
#define MAX 500
#define INF 999999999
int dist[MAX];
bool mark[MAX];
int mp[MAX][MAX];
int teams[MAX];
int amount[MAX];
int pathcount[MAX];
int n, m, start, en;

void dijkstra(int s){
	dist[s] = 0;
	amount[s] = teams[s];
	mark[s] = true;
	int newP = s;
	while (newP != en){
		for (int i = 0; i < n; i++){
			if (mark[i] == false){
				if (dist[i] > dist[newP] + mp[newP][i]){
					dist[i] = dist[newP] + mp[newP][i];
					amount[i] = amount[newP] + teams[i];
					pathcount[i] = pathcount[newP];
				}
				else if (dist[i] == dist[newP] + mp[newP][i]){
					pathcount[i] += pathcount[newP];
					if (amount[i] < amount[newP] + teams[i])
						amount[i] = amount[newP] + teams[i];
				}
			}
		}	
		int dmin = INF;
		for (int i = 0; i < n; i++){
			if (mark[i] == false && dist[i] < dmin){
				dmin = dist[i];
				newP = i;
			}
		}
		mark[newP] = true;
	}
}

int main(){
	//freopen("G:\\input.in", "r", stdin);
	scanf("%d%d%d%d", &n, &m, &start, &en);
	for (int i = 0; i < n; i++){
		scanf("%d", &teams[i]);
	}
	for (int i = 0; i < n; i++){
		dist[i] = INF;
		pathcount[i] = 1;
		mark[i] = false;
		for (int j = 0; j < n; j++)
			mp[i][j] = INF;
	}
	for (int i = 0; i < m; i++){
		int c1, c2, L;
		scanf("%d%d%d", &c1, &c2, &L);
		mp[c1][c2] = mp[c2][c1] = L;
	}
	dijkstra(start);
	printf("%d %d\n", pathcount[en], amount[en]);
	return 0;
}

dfs解法：

#include <cstdio>  
#include <climits>  

const int MAX = 501;
int wei[MAX], visit[MAX], map[MAX][MAX];
int mind, cnt, maxt, n;

void init(int n){
	int i, j;
	for (i = 0; i<n; ++i){
		visit[i] = 0;
		for (j = 0; j<n; ++j){
			map[i][j] = INT_MAX;
		}
	}
}

void dfs(int p, const int end, int dist, int weit){
	if (p == end){
		if (dist<mind){
			cnt = 1;
			mind = dist;
			maxt = weit;
		}
		else if (dist == mind){
			++cnt;
			if (maxt<weit){
				maxt = weit;
			}
		}
		return;
	}

	int i;

	if (dist>mind)return;//这个地方不剪枝的话最后一个case过不去  

	for (i = 0; i<n; ++i){
		if (visit[i] == 0 && map[p][i] != INT_MAX){
			visit[i] = 1;
			dfs(i, end, dist + map[p][i], weit + wei[i]);
			visit[i] = 0;
		}
	}

}

int main(){
	int m, st, end, x, y, d, i;
	mind = INT_MAX;
	cnt = 0;
	scanf("%d %d %d %d", &n, &m, &st, &end);
	init(n);
	for (i = 0; i<n; ++i){
		scanf("%d", &wei[i]);
	}
	while (m--){
		scanf("%d %d %d", &x, &y, &d);
		if (map[x][y]>d){
			map[x][y] = map[y][x] = d;
		}
	}
	dfs(st, end, 0, wei[st]);
	printf("%d %d\n", cnt, maxt);
	return 0;
}