原题: http://acm.hdu.edu.cn/showproblem.php?pid=2680
题目:
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10622 Accepted Submission(s): 3425
Problem Description
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
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
思路:
有n个点,m条路,可以从多个起点出发,但是每条路都是单向的,求到达点s的最短距离。
这道题只需要加入一个超级起点连接各个起点,就可以当作标准的dijkstra来做。
代码参考如下:
代码:
#include"iostream"
#include"cstring"
#include"cstdio"
using namespace std;
#define INF 0x3f7f7f7f
const int N = 1010; //点的个数上限
int maze[N][N];
int dis[N];
bool vis[N];
int n,m,s;
void init()
{
for(int i=0; i<N; i++)
{
for(int j=0;j<N; j++)
{
maze[i][j]=INF;
}
}
for(int i=0; i<N; i++)
{
dis[i]=INF;
}
memset(vis,false,sizeof(vis));
}
void dijkstra()
{
dis[0]=0;
vis[0]=true;
//因为0是新的起点,所以注意要初始化dis的初始值为该点到0的距离。
for(int i=0;i<=n;i++)
{
dis[i]=maze[0][i];
}
for(int i=0; i<=n; i++)
{
int minx=INF;
int minmark;
for(int j=0; j<=n; j++)
{
if(vis[j]==false&&dis[j]<minx)
{
minx=dis[j];
minmark=j;
}
}
vis[minmark]=true;
if(minx==INF) break;
for(int j=0; j<=n; j++)
{
if(vis[j]==false&&dis[j]>dis[minmark]+maze[minmark][j])
dis[j]=dis[minmark]+maze[minmark][j];
}
}
}
int main()
{
while(scanf("%d %d %d",&n,&m,&s)!=EOF)
{
init();
for(int i=1; i<=m; i++)
{
int x,y,len;
scanf("%d %d %d",&x,&y,&len);
if(x!=y&&maze[x][y]>len)
{
maze[x][y]=len;
}
}
int st;
scanf("%d",&st);
while(st--)
{
int point;
scanf("%d",&point);
maze[0][point]=0;
}
dijkstra();
if(dis[s]==INF)
printf("-1\n");
else
printf("%d\n",dis[s]);
}
}