Emergency (dijkstra 变形）

Emergency
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

//重新复习了下 dijkstra

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>

#define inf 0x3f3f3f3f
#define maxn 550
int n,m,c1,c2;

int num[maxn];        // 记录各个点人员数量 
int map[maxn][maxn];  // 路径 

int dis[maxn];        
int vis[maxn];
int path[maxn];      // 记录路径个数 
int amount[maxn];    //  记录到达各点最短距离的人员个数 

void dijkstra(int s)
{
    memset(dis,inf,sizeof(dis)); 
    memset(vis,0,sizeof(vis));

    dis[s] = 0;
    amount[s] = num[s];
    path[s] = 1;

    while(true)
    {
        int v = -1;
        for(int u = 0 ; u < n ; u ++)
            {
                if( vis[u] == 0 && (v == -1 || dis[u] < dis[v]))
                    v = u;
            }

        if( v == -1)  break;

        vis[v] = 1;

        for(int u = 0; u < n; u ++)
        {
            if(vis[u] == 0)
                {
                    if(dis[u] > dis[v] + map[v][u])    // 更新最短路径，更新人员数量，更新路径 
                        {
                            dis[u] = dis[v] + map[v][u];

                            amount[u] = amount[v] + num[u];

                            path[u] = path[v];
                        }
                    else if(dis[u] == dis[v] + map[v][u])
                        {
                            path[u] += path[v];

                            if(amount[u] < amount[v] + num[u])
                                amount[u] = amount[v] + num[u];
                        }
                }

        }
    }
}
int main()
{
    scanf("%d%d%d%d",&n,&m,&c1,&c2);

    for(int i=0;i<n;i++)
        scanf("%d",&num[i]);

    memset(map,inf,sizeof(map));

    int b,c,len;
    for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&b,&c,&len);
            map[b][c] = len;
            map[c][b] = len;
        }

    dijkstra(c1);

    printf("%d %d",path[c2],amount[c2]);
    return 0;
}