- 犯的错误
- 忽略了是无向图
- 当d[u]+G[u][v] == d[v]的时候,无论需不需要优化w点权,都应该让num[v] += num[u],因为最短路径的依据是第一标尺距离,与点权无关
#include <stdio.h>
#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
int n,m,c1,c2;
const int maxn = 510;
const int INF = 0x3f3f3f3f;
int G[maxn][maxn];
vector <int> d;
vector <int> w;
vector <int> num;
vector <int> weight;
vector <bool> vis;
void init(int c1)
{
fill(G[0],G[0]+maxn*maxn,INF);
d.resize(n,INF);
w.resize(n,0);
num.resize(n,0);
vis.resize(n,false);
num[c1] = 1;
w[c1] = weight[c1];
d[c1] = 0;
}
void dijsktra()
{
for(int i = 0;i<n;i++)
{
int u = -1;
int MIN = INF;
for(int j = 0;j<n;j++)
{
if(vis[j] == false && d[j] < MIN)
{
u = j;
MIN = d[j];
}
}
if(u == -1)
{
printf("不能构成连通图!");
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])
{
d[v] = d[u] + G[u][v];
num[v] = num[u];
w[v] = w[u] + weight[v];
}
else if(d[u] + G[u][v] == d[v])
{
num[v] += num[u];
if(w[u] + weight[v] > w[v])
{
w[v] = w[u] + weight[v];
}
}
}
}
}
}
int main()
{
scanf("%d %d %d %d",&n,&m,&c1,&c2);
weight.resize(n,0);
for(int i = 0;i<n;i++)
{
int w;
scanf("%d",&w);
weight[i] = w;
}
init(c1);
for(int i = 0;i < m;i++)
{
int city1,city2,L;
scanf("%d%d%d",&city1,&city2,&L);
G[city1][city2] = L;
G[city2][city1] = L;
}
dijsktra();
cout << num[c2] << " " << w[c2];
}