版权声明:// Copyright © 2018年 Coding18. All rights reserved. https://blog.csdn.net/Coding18/article/details/85988587
了解每个循环的意义 注意循环括号
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000;
const int inf = 1000000;
int G[maxn][maxn];
int weight[maxn];
int d[maxn],w[maxn] = {0},num[maxn]={0};
int n,m,st,t;
bool vis[maxn] = {false};
void dijkstra(int s)
{
fill(d,d+maxn,inf);
d[s] = 0;
num[s] = 1;
w[s] = weight[s];
for(int i = 0; i < n; i++)
{
int u = -1,min = inf;
for(int j = 0; j < n; j++)
{
if(vis[j] == false && d[j] < min)
{
u = j;
min = d[j];
}
}
if(u == -1) return;
vis[u] = true;
for(int v = 0; v < n; v++)
{
if(vis[v] == false && G[u][v] != inf)
{
if(d[u] + G[u][v] < d[v]){
num[v] = num[u];
w[v] = w[u] + weight[v];
d[v] = d[u]+G[u][v];
}
else if(d[u] + G[u][v] == d[v]){
if(w[u] + weight[v] > w[v]){
w[v] = w[u] +weight[v];
}
num[v] += num[u];
}
}
}
}
}
int main()
{
fill(G[0],G[0]+maxn*maxn,inf);
int u,v;
scanf("%d %d %d %d",&n,&m,&st,&t);
for(int i = 0; i < n; i++)
scanf("%d",&weight[i]);
for(int i = 0; i < m; i++){
scanf("%d%d",&u,&v);
scanf("%d",&G[u][v]);
G[v][u] = G[u][v];
}
dijkstra(st);
printf("%d %d",num[t],w[t]);
return 0;
}