1003 Emergency (25 分)

最短路径题，关键在于它的有多少条均是最短的通向终点，使用toi数组来存储
当更新dist时到达上一个点有多少条那么到现在这个点就有多少条
当等与dist时，toi要加上当前点的条数
（1）若d[j]==d[v]+cost[v][j]，则tot[j]+=tot[v]；num[j]=max(num[j],num[v]+a[j])

（2）若d[j]<d[v]+cost[v][j]，则tot[j]=tot[v]；num[j]=num[v]+a[j]

#include <iostream>
#include <cstring>
using namespace std;
const int N = 510;
int g[N][N];
int w[N];
int dist[N];
int num[N];
bool st[N];
int toi[N];
int ans;
int n, m, s, e;
int mind = 0x3f;
void dijkstra(int u)
{
	memset(dist, 0x3f, sizeof dist);
	dist[u] = 0;
	num[u] = w[u];
    toi[u] = 1;
	for (int i = 0; i < n - 1; i++) {
		int t = -1;
		for (int j = 0; j < n; j++) {
			if (!st[j] && (t == -1 || dist[j] < dist[t])) t = j;
		}
		st[t] = true;
		for (int j = 0; j < n; j++) {
			if (dist[j] > dist[t] + g[t][j]) {
				dist[j] = dist[t] + g[t][j];
				num[j] = num[t] + w[j];
                toi[j] = toi[t];
			}else if (dist[j] == dist[t] + g[t][j]) {
                toi[j] += toi[t];
				if (num[j] < num[t] + w[j]) {
					num[j] = num[t] + w[j];
				}
			}
		}
	}
}
int cont = 1;
int main()
{
	
	cin >> n >> m >> s >> e;
	memset(g, 0x3f, sizeof g);
	for (int i = 0; i < n; i++) cin >> w[i];
	for (int i = 1; i <= m; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		g[a][b] = c;
		g[b][a] = c;
	}
	dijkstra(s);
	int ans = num[e];
	cout << toi[e] << " " << ans << endl;
	return 0;
}