N个城市,M条路,每个城市有救援小组,所有的边的边权已知。给定起点和终点,求从起点到终点的最短路径条数以及所有最短路径中的救援小组数量最多的值。
思路:Dijkstra算法,救援小组个数相当于点权,用Dijkstra求最短路径的条数,以及所有最短路径中点权最大的值:
—— dist[i] 表示从出发点到 i 结点最短路径的路径长度
—— num[i] 表示从出发点到 i 结点最短路径的条数
—— people[i] 表示从出发点到 i 点救援队的数量之和
(1)若 dist[u] + G[u][v] < dist[v],更新 dis[v],同时更新 num[v] = num[u],people[v] = people[u] + peoples[v];
(2)若 dist[u] + G[u][v] == dis[v],更新num[v] += num[u],同时还需判断点权 people[v] < people[u] + peoples[v],如果成立则更新 people[v] = people[u] + peoples[v];
#include<iostream>
#include<string.h>
using namespace std;
#define INF 1000000000
int n,m,st,ed;
int peoples[500] = {0};
int G[500][500];
int dist[500] , people[500]={0} , num[500]={0} ;
bool visit[500] = {false};
void Dij(int st){
fill(dist,dist+500,INF);
dist[st] = 0;
people[st] = peoples[st];
num[st] = 1;
for(int i=0;i<n;i++){
int u = -1 , MIN = INF;
for(int j=0;j<n;j++){
if(visit[j]==false && dist[j] < MIN){
u = j;
MIN = dist[j];
}
}
if(u==-1) return;
visit[u] = true;
for(int v=0;v<n;v++){
if(visit[v]==false && G[u][v]!=INF){
if(dist[v] > dist[u]+G[u][v]){
dist[v] = dist[u] + G[u][v];
people[v] = people[u] + peoples[v];
num[v] = num[u];
}
else if(dist[v] == dist[u]+G[u][v]){
if(people[v] < people[u]+peoples[v])
people[v] = people[u]+peoples[v];
num[v] += num[u];
}
}
}
}
}
int main(){
cin >> n >> m >> st >> ed;
for(int i=0;i<n;i++){
cin >> peoples[i];
}
int s,e;
fill(G[0],G[0]+500*500,INF);
for(int i=0;i<m;i++){
cin >> s >> e;
cin >> G[s][e];
G[e][s] = G[s][e];
}
Dij(st);
cout << num[ed] << ' ' << people[ed];
}