题目链接在下方:
https://www.patest.cn/contests/gplt/L2-001
这道题就是一道最短路(dijkstra算法),将模板稍作修改就行了,就是再另外加一个记录路线条数的数组(即当路的长度与下一个需要判断的
节点的长度相等时路线就相加)和一个记录每个节点在最短路基础上的车的总数量的数组,然后就ok了,代码如下:
#include <cstdio>
#include <iostream>
#include <cstring>
#define MAXN 1000000000
using namespace std;
int ma[505][505], dis[505], pre[505], car[505], totcar[505], pathnum[505];
bool vis[505];
void spath(int v0, int n)
{
int v, w, k, minn;
vis[v0] = 1;
dis[v0] = 0;
totcar[v0] = car[v0];
pathnum[v0] = 1;
for(v=0; v<n; v++)
{
dis[v] = ma[v0][v];
if(ma[v0][v] != MAXN && v!=v0)
{
pre[v] = v0;
totcar[v] = car[v0] + car[v];
pathnum[v] = 1;
}
}
for(v=1; v<n; v++)
{
minn = MAXN;
k=v0;
for(w=0; w<n; w++)
{
if(!vis[w]&&dis[w]<minn)
{
k=w;
minn=dis[w];
}
}
vis[k]=1;
for(w=0; w<n; w++)
{
if(!vis[w])
{
if(minn+ma[k][w]<dis[w])
{
pathnum[w] = pathnum[k];
dis[w]=minn+ma[k][w];
pre[w]=k;
totcar[w] = totcar[k]+car[w];
}
else if(minn+ma[k][w] == dis[w])
{
pathnum[w] += pathnum[k];
if(totcar[w] < totcar[k]+car[w])
{
totcar[w] = totcar[k]+car[w];
pre[w] = k;
}
}
}
}
}
}
void create(int n, int m)
{
int A, B, C;
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
ma[i][j] = MAXN;
for(int i=1; i<=m; i++)
{
cin >> A >> B >> C;
ma[A][B] = ma[B][A] = C;
}
}
int main()
{
int n, m, s, d;
cin >> n >> m >> s >> d;
for(int i=0; i<n; i++)
cin >> car[i];
create(n, m);
spath(s, n);
int i=0, , path[505], cur=d;
while(cur!=s)
{
path[i++] = cur;
cur = pre[cur];
}
path[i] = s;
printf("%d %d\n", pathnum[d], totcar[d]);
for(int j=i; j>0; j--)
printf("%d ", path[j]);
printf("%d\n", path[0]);
return 0;
}