PAT 1003. Emergency (25) (求两点间最短路的条数)

版权声明:原创文章,转载请注明出处。本博新地址www.iaccepted.net https://blog.csdn.net/IAccepted/article/details/21451949

1003. Emergency (25)

时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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

题目的意思就是一张图,各边都有权值而且个点也有权值,求出给定两点之间最短路的条数并输出此路径上的点权值和的最大值。就是求出最短路的条数,若有多条相同的最短路输出最大的那个点权值和。

很简单的题目,一个dfs就可以很好的解决掉。

当然这个题目还可以继续增加点复杂度,就是把各条最短路的路径打印出来,这个也是很好实现的,加个pre数组,然后可以再来个dfs,当然也可以先来遍迪杰斯特拉。


#include <cstdio>
#include <cstdlib>
#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;
}


最新文章地址 凌风技术站-pat1003


展开阅读全文

没有更多推荐了,返回首页