题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805523835109376
关键词:无向图、Dijkstra算法
#include <iostream>
#include <algorithm>
#define maxnum 510
using namespace std;
int n,m,c1,c2;
int e[maxnum][maxnum],weight[maxnum],dis[maxnum],num[maxnum],w[maxnum];
bool visit[maxnum];
const int inf=99999999;
int main(){
scanf("%d %d %d %d",&n,&m,&c1,&c2);
for(int i=0;i<n;i++)
scanf("%d",&weight[i]);
fill(e[0],e[0]+maxnum*maxnum,inf);
fill(dis,dis+maxnum,inf);
int a,b,c;
for(int i=0;i<m;i++){
scanf("%d %d %d",&a,&b,&c);
e[a][b]=e[b][a]=c;
}
dis[c1]=0;
w[c1]=weight[c1];
num[c1]=1;
for(int i=0;i<n;i++){
int u=-1,minn=inf;
for(int j=0;j<n;j++){
if(visit[j]==false && dis[j]<minn){
u=j;
minn=dis[j];
}
}
if(u==-1) break;
visit[u]=true;
for(int v=0;v<n;v++){
if(visit[v]==false && e[u][v]!=inf){
if(e[u][v]+dis[u]<dis[v]){
dis[v]=e[u][v]+dis[u];
num[v]=num[u];
w[v]=w[u]+weight[v];
}
else if(e[u][v]+dis[u]==dis[v]){
num[v]=num[u]+num[v];
if(w[u]+weight[v]>w[v])
w[v]=w[u]+weight[v];
}
}
}
}
printf("%d %d", num[c2], w[c2]);
return 0;
}
后记:判断路程的时候需要对点进行标记。