PAT（甲级）1003 Emergency (最短路)

只需在Dijkstra最短路径的维护过程中，附带更新“等路径长条数”以及“最多的队伍人手”，即可。

考点是：在最短路算法中，并不是每一条路径都能“真正意义上走一遍”，这不同于DFS爆搜，在统计有多少方式能到某个节点时，只能以传递和累加的方式更新信息。

我的收获：熟悉了链式向前星建立无向图，但要注意maxn至少是边的四倍！这里数据500比较小可以直接取平方
优先队列维护pair最小堆虽然用得比较多，但需要熟悉下最简单方法。

/*
* @Author: Achan
* @Date:   2018-10-26 17:58:34
* @Last Modified by:   Achan
* @Last Modified time: 2019-08-07 18:52:38
*/
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

#define X             first
#define Y             second
#define eps          1e-2
#define gcd         __gcd
#define pb             push_back
#define PI             acos(-1.0)
#define lowbit(x)     (x)&(-x)
#define fin         freopen("in.txt","r",stdin);
#define fout        freopen("out.txt","w",stdout);
#define bug         printf("!!!!!\n");
#define mem(x,y)    memset(x,y,sizeof(x))
#define rep(i,j,k)  for(int i=j;i<(int)k;i++)
#define per(i,j,k)  for(int i=j;i<=(int)k;i++)
#define io std::ios::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);

typedef long long ll;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long ull;

inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

const int inf  = 1<<30;
const ll  INF  = 1e18 ;
const int mod  = 1e9+7;
const int maxn = 5e2+2;
int head[maxn], dis[maxn], arv[maxn], hand[maxn];
bool vis[maxn];
struct node
{
    int to;
    int nex;
    int w;
    int h;
}edge[maxn*maxn];
int top;
int n;
void init()
{
    //memset(arv,1,sizeof(arv));//无法这样初始化1
    for(int i = 0; i < maxn; i++) arv[i] = 1;
    memset(hand,0,sizeof(hand));
    memset(head,-1,sizeof(head));
    top = 0;
}

inline void add_edge(int u, int v, int w, int handv, int handu) //链式向前星图
{
    edge[top].to = v;
    edge[top].w  = w;
    edge[top].h  = handv;
    edge[top].nex = head[u];
    head[u] = top;
    top++;

    edge[top].to = u;
    edge[top].w  = w;
    edge[top].h  = handu;
    edge[top].nex = head[v];
    head[v] = top;
    top++;
}
void Dijkstra(int s)
{
    memset(vis,0,sizeof(vis));
    fill(dis,dis+maxn,inf);
    priority_queue <pair<ll, int> > q;
    q.push(make_pair(0,s));
    dis[s] = 0;
    while(!q.empty())
    {
        int cur  = q.top().second;
        q.pop();
        if(vis[cur]) continue;
        vis[cur] = 1;
        for(int i = head[cur]; ~i; i=edge[i].nex)
        {
            int w = edge[i].w;
            int h = edge[i].h;
            int to = edge[i].to;
            if(!vis[to])
            {
                if(dis[to] == dis[cur] + w){
                    arv[to] += arv[cur];   //能够以相同路长到达的数量
                    hand[to] = max(hand[to],hand[cur] + h); //更新最多人手
                }
                else if(dis[to] > dis[cur] + w){
                    arv[to] = arv[cur]; //变为更新最短路后的条数
                    hand[to] = hand[cur] + h; //新的最短路，直接更新人手
                    dis[to] = dis[cur] + w;
                }
                // cout<<"from : "<<cur<<" to :"<<to<<" val :"<<dis[to]<<endl;
                q.push(make_pair(-dis[to], to));

            }
        }
    }
}
int main(void)
{
    io
    int m,u,v,w,s,t;
    //cin >> n >> m >> s >> t;
    n = read() , m = read(), s = read(), t = read();
    std::vector<int> hands(n);
    for(int i = 0; i < n; i++) hands[i] = read();
    init();
    while(m--)
    {
        //cin >> u >> v >> w;
        u = read() , v = read(), w = read();
        add_edge(u,v,w,hands[v],hands[u]);
    }
    Dijkstra(s);
    cout<< arv[t] << " " << hands[s] + hand[t] << endl;
    return 0;
}

常用的最短路解法
（先留坑，看心情补不补）