Choose the best route

最新推荐文章于 2022-08-29 17:13:17 发布

「已注销」

最新推荐文章于 2022-08-29 17:13:17 发布

阅读量240

点赞数

CC 4.0 BY-SA版权

分类专栏：图论最短路

本文链接：https://blog.csdn.net/aini875/article/details/82948819

图论最短路专栏收录该内容

13 篇文章

订阅专栏

本文深入探讨了如何解决特定场景下的最短路径问题，通过逆向思维从终点到起点寻找路径，特别关注单向路程的处理。文章提供了一个具体实例，展示了如何在存在多个车站的城市交通路线中，为容易晕车的Kiki找到到达朋友家的最快路线。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.

Input

There are several test cases.
Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home.
Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes .
Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations.

Output

The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.

Sample Input

Sample Output

1
-1

这道题是最短路啊，但是你需要从终点向起点走，但是呢路程是单向的，并且你要格外注意这件事，我头铁错了好多次啊，但是也要努力啊！

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<stack>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
int a[1111][1111],dis[1111];
bool book[1111];
int n,m,en;
int main()
{
while(~scanf("%d%d%d",&n,&m,&en))
{
int i,j,k,t1,t2,t3,u,v;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(i==j)
a[i][j]=0;
else
a[i][j]=inf;

}
for(i=1;i<=m;i++)
{
scanf("%d%d%d",&t1,&t2,&t3);
if(t3<a[t2][t1])
{
a[t2][t1]=t3;

}
}
for(i=1;i<=n;i++)
{
book[i]=0;
dis[i]=a[en][i];
}
book[en]=1;
int minn;
for(i=1;i<=n-1;i++)
{
minn=inf;
for(j=1;j<=n;j++)
{
if(!book[j]&&dis[j]<minn)
{
minn=dis[j];
u=j;
}

}
book[u]=1;
for(v=1;v<=n;v++)
{
if(!book[v]&&a[u][v]!=inf&&dis[v]>dis[u]+a[u][v])
dis[v]=dis[u]+a[u][v];
}
}
int a,x,ans=inf;
scanf("%d",&a);
for(i=1;i<=a;i++)
{
scanf("%d",&x);
if(ans>dis[x])
ans=dis[x];
}
if(ans!=inf)
printf("%d\n",ans);
else
printf("-1\n");
}
return 0;
}