1003. Emergency (25)

Dijkstra 求最短路径

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#define INF 0x3f3f3f3f
using namespace std;
int graph[507][507];
int dis[507];
bool book[507];
int amt[507];
int res[507];
int path[507];
void DIJKSTRA(int v, int n){
	for(int i = 0; i < n; i ++){
		dis[i] = graph[v][i];
		book[i] = 0;
		path[i] = 1;
		res[i] = amt[v] + amt[i];
	}
	dis[v] = 0; book[v] = 1;
	int min, index;
	for(int i = 1; i < n; i ++){
		min = INF;
		for(int j = 0; j < n; j ++){
			if(book[j]) continue;
			if(dis[j] < min) min = dis[j], index = j;
		}
		book[index] = 1;
		for(int j = 0; j < n; j ++){
			if(book[j]) continue;
			if(dis[index] + graph[index][j] == dis[j]){
				path[j] += path[index];
				if(res[index] + amt[j] > res[j]) res[j] = res[index] + amt[j];
			}
			if(dis[index] + graph[index][j] < dis[j]){
				dis[j] = dis[index] + graph[index][j];
				path[j] = path[index];
				res[j] = res[index] + amt[j];
			}
		}
	}
}
int main(){
		int n, m, s, t, a, b, c;
		cin>>n>>m>>s>>t;
		memset(graph, INF, sizeof(graph));
		for(int i = 0; i < n; i ++) cin>>amt[i];
		for(int i = 0; i < m; i ++){
			cin>>a>>b>>c;
			graph[a][b] = c;
			graph[b][a] = c;
		}
		if(n == 1) cout<<"1 "<<amt[0]<<endl;
		else DIJKSTRA(s,n), cout<<path[t]<<" "<<res[t]<<endl;