Choose the best route (最短路)
2018-01-31 11:26
204 查看
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.
InputThere 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.
OutputThe 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
#include<stdio.h>
#include<string.h>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1005;
int n, m, s;
int maze[MAX][MAX], dis[MAX], vis[MAX];
void dijk(int s)
{
for(int i=1; i<=n; i++)
dis[i] = maze[s][i];
vis[s] = 1;
dis[s] = 0;
for(int i=1; i<n; i++)
{
int min = INF, indx;
for(int j = 1; j <= n; j++)
if(!vis[j] && dis[j] < min)
{
min = dis[j];
indx = j;
}
if(min == INF)
break;
vis[indx] = 1;
for(int j=1; j<=n; j++)
if(!vis[j] && dis[indx] + maze[indx][j] < dis[j])
dis[j] = dis[indx] + maze[indx][j];
}
}
int main()
{
while(scanf("%d%d%d",&n,&m,&s)!=EOF)
{
memset(vis,0,sizeof(vis));
memset(maze,INF,sizeof(maze));
while(m--)
{
int x, y, w;
scanf("%d%d%d",&x,&y,&w);
if(w < maze[y][x])
maze[y][x] = w; //注意是有向的,反方向
}
dijk(s);
int a, b, ans = INF;
scanf("%d",&b);
for(int i=1; i<=b; i++)
{
scanf("%d", &a);
ans = min(ans,dis[a]);
}
if(ans!=INF)
printf("%d\n", ans);
else
printf("-1\n");
}
return 0;
}
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.
InputThere 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.
OutputThe 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
5 8 5 1 2 2 1 5 3 1 3 4 2 4 7 2 5 6 2 3 5 3 5 1 4 5 1 2 2 3 4 3 4 1 2 3 1 3 4 2 3 2 1 1
Sample Output
1 -1
#include<stdio.h>
#include<string.h>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
const int MAX = 1005;
int n, m, s;
int maze[MAX][MAX], dis[MAX], vis[MAX];
void dijk(int s)
{
for(int i=1; i<=n; i++)
dis[i] = maze[s][i];
vis[s] = 1;
dis[s] = 0;
for(int i=1; i<n; i++)
{
int min = INF, indx;
for(int j = 1; j <= n; j++)
if(!vis[j] && dis[j] < min)
{
min = dis[j];
indx = j;
}
if(min == INF)
break;
vis[indx] = 1;
for(int j=1; j<=n; j++)
if(!vis[j] && dis[indx] + maze[indx][j] < dis[j])
dis[j] = dis[indx] + maze[indx][j];
}
}
int main()
{
while(scanf("%d%d%d",&n,&m,&s)!=EOF)
{
memset(vis,0,sizeof(vis));
memset(maze,INF,sizeof(maze));
while(m--)
{
int x, y, w;
scanf("%d%d%d",&x,&y,&w);
if(w < maze[y][x])
maze[y][x] = w; //注意是有向的,反方向
}
dijk(s);
int a, b, ans = INF;
scanf("%d",&b);
for(int i=1; i<=b; i++)
{
scanf("%d", &a);
ans = min(ans,dis[a]);
}
if(ans!=INF)
printf("%d\n", ans);
else
printf("-1\n");
}
return 0;
}
相关文章推荐
- HDU2680 Choose the best route(最短路)
- HDU 2680Choose the best route(dijk最短路)
- HDU2680 - Choose the best route - 最短路(多起点集合)
- HDU-2680 Choose the best route(最短路[Dijkstra])
- HDOJ Choose the best route (最短路倒着构图Dijkstra)
- HDOJ 2680 Choose the best route (最短路之SPFA)
- hdu 2680 Choose the best route(最短路)
- hdu-2680Choose the best route (dijkstra求最短路)
- HDU2680 Choose the best route (最短路)(Dijkstra算法)
- hdu2680最短路Choose the best route
- HDU 2680 Choose the best route【最短路】
- hdu 2680 Choose the best route 最短路
- HDU 2680 Choose the best route (最短路)
- Hud 2680 Choose the best route[基础最短路]
- HdU2680——Choose the best route(单源最短路Bell man-ford)
- hdu 2680 Choose the best route 最短路 解题报告
- HDU 2680 Choose the best route 最短路
- hdu 2680 Choose the best route(最短路dijkstra(有重边))
- HDU 2680 Choose the best route 最短路
- HDU 2680 Choose the best route(最短路,反向)