PATj甲级1003

#include <iostream>
#include <cstring>
using namespace std;
const int N = 510;
const int INF = 0x3f3f3f;
int n, m, c1, c2;
int map[N][N], a[N], d[N], num[N], tot[N], vis[N];
int x, y, l;
void dij()
{
    int v;
    tot[c1] = 1;
    d[c1] = 0;
    num[c1] = a[c1];
    for (int i = 0; i < n; i++)
    {
        int v = -1;
        for (int j = 0; j < n; j++)
        {
            if (!vis[j] && (v == -1 || d[j] < d[v]))
                v = j;
        }
        vis[v] = 1;
        for (int j = 0; j < n; j++)
        {
            if(j==v)continue;
            if (d[j] == d[v] + map[v][j])
            {
                tot[j] += tot[v];
                num[j] = max(num[j], num[v] + a[j]);
            }
            if (d[j] > d[v] + map[v][j])
            {
                d[j] = d[v] + map[v][j];
                tot[j] = tot[v];
                num[j] = num[v] +a[j];
            }
        }
    }
}
int main()
{
    cin >> n >> m >> c1 >> c2;
    memset(d, INF, sizeof d);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            if (i == j)
                continue;
            map[i][j] = INF;
        }
    }
    while (m--)
    {
        cin >> x >> y >> l;
        map[x][y] = l, map[y][x] = l;
    }
    dij();
    cout << tot[c2] << " " << num[c2];
}