Choose the best route

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 <iostream>
#include <queue>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <math.h>
using namespace std;
#define MAXV 1010
#define INF 0x3f3f3f3f
int map[MAXV][MAXV],n,m,s,W;
int vis[MAXV],cast[MAXV];void Dijkstra()
{int minn,pos;memset(vis,0,sizeof(vis));vis[0] = 1;for(int i = 0; i<=n; i++)cast[i] = map[0][i];for(int i = 0; i<=n; i++){minn = INF;for(int j = 0; j<=n; j++){if(cast[j]<minn && !vis[j]){pos = j;minn = cast[j];}}vis[pos] = 1;for(int j = 0; j<=n; j++){if(cast[pos]+map[pos][j]<cast[j] && !vis[j])cast[j] = cast[pos]+map[pos][j];}}
}int main()
{while(~scanf("%d%d%d",&n,&m,&s)){for(int i=0; i<=n; i++)for(int j=0;j<=n;j++)if(i==j) map[i][j]=0;else map[i][j]=INF;int p,q,t;for(int i=1;i<=m;i++){scanf("%d%d%d",&p,&q,&t);if(t<map[p][q])map[p][q] = t;}scanf("%d",&W);int x;while(W--){scanf("%d",&x);map[0][x] = 0;}Dijkstra();if(cast[s]==INF)cout << -1 << endl;else cout << cast[s] << endl;}//cout << "Hello world!" << endl;return 0;
}

Choose the best route相关推荐

HDU 2068 Choose the best route
http://acm.hdu.edu.cn/showproblem.php?pid=2680 Problem Description One day , Kiki wants to visit one ...
hdu 2680 Choose the best route
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=2680 简单最短路问题..... 运行结果: Accepted 2680 265MS 4164K 138 ...
AcWing 1137. Choose the best route（朴素dijkstra反向建图 or 虚拟源点法）
题目比较简单,讲两种做法法一.二都是用的朴素dijkstra算法法一:反向建图求终点s到每个起点的最短距离 O(T * (n^2 + n))(T表示多组测试数据)820ms #include & ...
What are HANA's models of cloud computing, and which should I choose?
What are HANA's models of cloud computing, and which should I choose? http://searchsap.techtarget.co ...
我如何使用深度学习通过Fast.ai对医学图像进行分类
by James Dietle 詹姆斯·迪特尔(James Dietle) Convolutional Neural Networks (CNNs) have rapidly advanced the ...
Logstash Introduction
https://www.cnblogs.com/aresxin/p/8035137.html Elasticsearch是个开源分布式搜索引擎,提供搜集.分析.存储数据三大功能.它的特点有:分布式,零 ...
【HDOJ图论题集】【转】
1 =============================以下是最小生成树+并查集====================================== 2 [HDU] 3 1213 How ...
一系列图论问题[转]
=============================以下是最小生成树+并查集====================================== [HDU] 1213 How Many ...
【转载】图论 500题——主要为hdu/poj/zoj
转自--http://blog.csdn.net/qwe20060514/article/details/8112550 =============================以下是最小生成树+并 ...

Choose the best route

Choose the best route相关推荐

最新文章

热门文章