L2.001 紧急救援（Dijkstra最短路，nlogn写法）

这题让我小鼠迷宫问题，我百度到的写法是宽搜时记录路径，如果重复遇到就加上路径，否则如果第一次遇到继承上一点的路径数目。

建图时我建的有向图，学长帮我找到的错误。

另外当又不同路径遇到同一个交叉节点时，只需要更新路径数目，不需要再把该点压入队列，因为该点肯定已经在队列里了，前面有几条路到达它必须先算完。

后面注释的是百度的代码，不记得是哪儿的了，，，，

#include <bits/stdc++.h>
using namespace std;
#define MAXN 505
#define INF 1000000000

typedef pair<int, int> P;
struct edge{
  int v, w;
};
vector<edge> G[MAXN];
int n, m, s, d;
int num[MAXN];//total cars
int dis[MAXN];
int maxnum[MAXN] = {0}, cnt[MAXN] = {0};
int path[MAXN], ans[MAXN], k = 0;

void dijkstra()
{
    priority_queue< P, vector<P>, greater<P> > que;
    fill(dis, dis + MAXN, INF);

    dis[s] = 0;
    que.push(P(0, s));
    maxnum[s] = num[s];
    cnt[s] = 1;

    while(!que.empty())
    {
        P head = que.top();que.pop();

        int v = head.second;

        if(dis[v] < head.first)
            continue;

        for(int i = 0; i < G[v].size(); i++){
            edge e = G[v][i];

            if(dis[e.v] > dis[v] + e.w){
                dis[e.v] = dis[v] + e.w;
                cnt[e.v] = cnt[v];
                path[e.v] = v;
                maxnum[e.v] = maxnum[v] + num[e.v];
                que.push(P(dis[e.v], e.v));
                //printf("%d\n", e.v);
            }else if(dis[e.v] == dis[v] + e.w){
                cnt[e.v] += cnt[v];
                if(maxnum[v] + num[e.v] > maxnum[e.v]){
                    maxnum[e.v] = maxnum[v] + num[e.v];
                    path[e.v] = v;
                   // que.push(P(dis[e.v], e.v));
                }
                //printf("%d", e.v);
            }
        }
    }
}

int main()
{
    scanf("%d%d%d%d", &n, &m, &s, &d);

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

    for(int i = 0; i < m; i++){
        edge e;
        int u;
        scanf("%d%d%d", &u, &e.v, &e.w);
        G[u].push_back(e);
        int temp = e.v;
        e.v = u;
        u = temp;
        G[u].push_back(e);
    }

    dijkstra();

    printf("%d %d\n", cnt[d], maxnum[d]);
    int temp = d;
    while(temp != s){
        ans[k++] = temp;
        temp = path[temp];
    }
    ans[k] = s;
    for(int i = k; i >= 0; i--)
        printf("%d%c", ans[i], i == 0?'\n':' ');

    return 0;
}
/**
#include <cstdio>
#include <iostream>
#include <cstring>
#define MAXN 1000000000

using namespace std;

int ma[505][505], dis[505], pre[505], car[505], totcar[505], pathnum[505];
bool vis[505];
void spath(int v0, int n)
{
    int v, w, k, minn;
    vis[v0] = 1;
    dis[v0] = 0;
    totcar[v0] = car[v0];
    pathnum[v0] = 1;
    for(v=0; v<n; v++)
    {
        dis[v] = ma[v0][v];
        if(ma[v0][v] != MAXN && v!=v0)
        {
            pre[v] = v0;
            totcar[v] = car[v0] + car[v];
            pathnum[v] = 1;
        }
    }

    for(v=1; v<n; v++)
    {
        minn = MAXN;
        k=v0;
        for(w=0; w<n; w++)
        {
            if(!vis[w]&&dis[w]<minn)
            {
                k=w;
                minn=dis[w];
            }
        }
        vis[k]=1;
        for(w=0; w<n; w++)
        {
            if(!vis[w])
            {
                if(minn+ma[k][w]<dis[w])
                {
                    pathnum[w] = pathnum[k];
                    dis[w]=minn+ma[k][w];
                    pre[w]=k;
                    totcar[w] = totcar[k]+car[w];
                }
                else if(minn+ma[k][w] == dis[w])
                {
                    pathnum[w] += pathnum[k];
                    if(totcar[w] < totcar[k]+car[w])
                    {
                        totcar[w] = totcar[k]+car[w];
                        pre[w] = k;
                    }
                }
            }
        }
    }
}

void create(int n, int m)
{
    int A, B, C;
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            ma[i][j] = MAXN;
    for(int i=1; i<=m; i++)
    {
        cin >> A >> B >> C;
        ma[A][B] = ma[B][A] = C;
    }
}

int main()
{
    int n, m, s, d;
    cin >> n >> m >> s >> d;
    for(int i=0; i<n; i++)
        cin >> car[i];
    create(n, m);
    spath(s, n);
    int i=0, path[505], cur=d;
    while(cur!=s)
    {
        path[i++] = cur;
        cur = pre[cur];
    }
    path[i] = s;
    printf("%d %d\n", pathnum[d], totcar[d]);
    for(int j=i; j>0; j--)
        printf("%d ", path[j]);
    printf("%d\n", path[0]);

    return 0;
}
*/
/**
4 7 0 3
20 30 40 10
0 1 1
1 3 2
0 3 3
0 3 2
0 2 2
2 3 2
2 3 1
*/