思路:开一个数组cnt取统计最短路条数,开一个数组sum统计到当前点的点权和,pre记录上一条边是哪条边(也可以直接记录是哪个点)。
①松弛操作时,如果两个值相等,最短路径条数就等于前驱结点的最短路径条数加上该节点的最短路径条数,然后再判断点权是否需要更新,如需要更新,pre数组也要对应更新。
②松弛操作时,如果可以松弛,最短路径条数就等于前驱结点的最短路径条数数,sum数组更新,pre数组更新。
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 505;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, dist; //起点,终点,距离
Edge(int u, int v, int w):from(u), to(v), dist(w) {}
};
struct Dijkstra
{
int n, m, S, D; //结点数,边数(包括反向弧)
vector<Edge> edges; //边表。edges[e]和edges[e^1]互为反向弧
vector<int> G[MAXN]; //邻接表,G[i][j]表示结点i的第j条边在edges数组中的序号
int vis[MAXN]; //标记数组
int d[MAXN]; //s到各个点的最短路
int pre[MAXN]; //上一条弧
int a[MAXN]; //每个点的救援队数量
int sum[MAXN]; //最短路径上的救援队数量
int cnt[MAXN]; //到当前点不同的最短路条数
void init(int n, int s, int d)
{
this->n = n; S = s; D = d;
edges.clear();
for (int i = 0; i <= n; i++) G[i].clear();
}
void add_edge(int from, int to, int dist)
{
edges.push_back(Edge(from, to, dist));
m = edges.size();
G[from].push_back(m - 1);
}
struct HeapNode
{
int from, dist;
bool operator < (const HeapNode& rhs) const
{
return rhs.dist < dist;
}
HeapNode(int u, int w): from(u), dist(w) {}
};
void dijkstra()
{
memset(d, 127, sizeof(d));
memset(vis, 0, sizeof(vis));
memset(pre, -1, sizeof(pre));
memset(sum, 0, sizeof(sum)); sum[S] = a[S];
for (int i = 0; i <= n; i++) cnt[i] = 1;
priority_queue<HeapNode> Q;
d[S] = 0;
Q.push(HeapNode(S, 0));
while (!Q.empty())
{
HeapNode x = Q.top(); Q.pop();
int u = x.from;
if (vis[u]) continue;
vis[u] = true;
for (int i = 0; i < G[u].size(); i++)
{
Edge& e = edges[G[u][i]];
if (d[e.to] > d[u] + e.dist)
{
d[e.to] = d[u] + e.dist;
cnt[e.to] = cnt[u];
sum[e.to] = sum[u] + a[e.to];
pre[e.to] = G[u][i];
Q.push(HeapNode(e.to, d[e.to]));
}
else if (d[e.to] == d[u] + e.dist)
{
cnt[e.to] += cnt[u];
if (sum[e.to] < sum[u] + a[e.to])
{
sum[e.to] = sum[u] + a[e.to];
pre[e.to] = G[u][i];
}
Q.push(HeapNode(e.to, d[e.to]));
}
}
}
}
void output(int x)
{
if (x == S)
{
printf("%d %d\n", cnt[D], sum[D]);
printf("%d", x);
return ;
}
output(edges[pre[x]].from);
printf(" %d", x);
}
};
int n, m, S, D, a[MAXN];
Dijkstra solve;
int main()
{
scanf("%d%d%d%d", &n, &m, &S, &D);
for (int i = 0; i < n; i++) scanf("%d", &solve.a[i]);
solve.init(n, S, D);
while (m--)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
solve.add_edge(u, v, w);
solve.add_edge(v, u, w);
}
solve.dijkstra();
solve.output(D);
return 0;
}
/*
4 5 0 3
20 30 40 10
0 1 1
1 3 2
0 3 3
0 2 2
2 3 2
*/