【PAT甲级】1003 Emergency（Dijkstra单源最短路）

#include <bits/stdc++.h>

using namespace std;

const int N = 510;
int n, m, S, T;
int e[N][N], w[N];
int dist[N], cnt[N], sum[N];
bool st[N];
void dijkstra()
{
    memset(dist, 0x3f, sizeof dist);
    dist[S] = 0, cnt[S] = 1, sum[S] = w[S];
    for(int i = 0; i < n - 1; i ++)
    {
        int t = -1;
        for(int j = 0; j < n; j++)
            if(!st[j] && (t == -1 || dist[t] > dist[j]))
            t = j;
        st[t] = true;
        for(int j = 0; j < n; j++)
        {
            if(dist[j] > dist[t] + e[t][j])
            {
                dist[j] = dist[t] + e[t][j];
                cnt[j] = cnt[t];
                sum[j] = sum[t] + w[j];
            }
            else if(dist[j] == dist[t] + e[t][j])
            {
                cnt[j] += cnt[t];
                sum[j] = max(sum[j], sum[t] + w[j]);
            }
        }
    }
}

int main()
{
    memset(e, 0x3f, sizeof e);
    cin >> n >> m >> S >> T;
    for(int i = 0; i < n; i ++) cin >> w[i];
    for(int i = 0; i < m; i ++)
    {
        int a, b, len;
        cin >> a >> b >> len;
        e[a][b] = e[b][a] = len;
    }
    
    dijkstra();
    
    cout << cnt[T] << ' ' << sum[T];
}