HDU 2680 最短路
来源:互联网 发布:维棠flv mac 编辑:程序博客网 时间:2024/05/17 23:20
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10909 Accepted Submission(s): 3537
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.
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 51 2 21 5 31 3 42 4 72 5 62 3 53 5 14 5 122 34 3 41 2 31 3 42 3 211
Sample Output
1-1
建立反图
终点变起点
#include<cstdio>
#include<iostream>
#include<cstring>
#define INF 999999
using namespace std;
void dijkstra(int x);
int map[1005][1005]={0};
int d[1005]={0};
int n=0,mX=0,s=0;
int main()
{
while(scanf("%d%d%d",&n,&mX,&s)!=EOF)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
map[i][j]=INF;
if(i==j) map[i][j]=0;
}
}
memset(d,0,sizeof(d));
for(int i=1;i<=mX;i++)
{
int a=0,b=0,c=0;
scanf("%d%d%d",&a,&b,&c);
if(map[b][a]>c) map[b][a]=c;
}
dijkstra(s);
int min=INF;
int w=0;
scanf("%d",&w);
for(int i=1;i<=w;i++)
{
int x=0;
scanf("%d",&x);
if(min>d[x]) min=d[x];
}
if(min!=INF)
printf("%d\n",min);
else
printf("-1\n");
}
return 0;
}
void dijkstra(int x)
{
int i,j,min,mark,used[1010];
for(i=1;i<=n;i++)
{
used[i]=0;
d[i]=map[x][i];
}
d[x]=0;
used[x]=1;
for(i=1;i<=n;i++)
{
min=INF;
mark=-1;
for(j=1;j<=n;j++)
{
if(!used[j]&&d[j]<min)
{
min=d[j];
mark=j;
}
}
if(mark==-1)
break;
used[mark]=1;
for(j=1;j<=n;j++)
{
if(!used[j]&&d[j]>d[mark]+map[mark][j])
d[j]=d[mark]+map[mark][j];
}
}
}
#include<iostream>
#include<cstring>
#define INF 999999
using namespace std;
void dijkstra(int x);
int map[1005][1005]={0};
int d[1005]={0};
int n=0,mX=0,s=0;
int main()
{
while(scanf("%d%d%d",&n,&mX,&s)!=EOF)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
map[i][j]=INF;
if(i==j) map[i][j]=0;
}
}
memset(d,0,sizeof(d));
for(int i=1;i<=mX;i++)
{
int a=0,b=0,c=0;
scanf("%d%d%d",&a,&b,&c);
if(map[b][a]>c) map[b][a]=c;
}
dijkstra(s);
int min=INF;
int w=0;
scanf("%d",&w);
for(int i=1;i<=w;i++)
{
int x=0;
scanf("%d",&x);
if(min>d[x]) min=d[x];
}
if(min!=INF)
printf("%d\n",min);
else
printf("-1\n");
}
return 0;
}
void dijkstra(int x)
{
int i,j,min,mark,used[1010];
for(i=1;i<=n;i++)
{
used[i]=0;
d[i]=map[x][i];
}
d[x]=0;
used[x]=1;
for(i=1;i<=n;i++)
{
min=INF;
mark=-1;
for(j=1;j<=n;j++)
{
if(!used[j]&&d[j]<min)
{
min=d[j];
mark=j;
}
}
if(mark==-1)
break;
used[mark]=1;
for(j=1;j<=n;j++)
{
if(!used[j]&&d[j]>d[mark]+map[mark][j])
d[j]=d[mark]+map[mark][j];
}
}
}
0 0
- HDU 2680 最短路
- hdu 2680 最短路
- HDU 2680 最短路
- hdu 2680 最短路
- hdu 2680最短路dijkstra
- 最短路 2544hdu
- HDU 2544 最短路
- hdu 1245 最短路
- HDU最短路总结
- hDU 最短路
- hdu 1874 (最短路)
- hdu 2112 (最短路)
- HDU-2544 最短路
- Hdu-2544 最短路
- hdu 2066 最短路
- HDU 2544 最短路
- 最短路 hdu
- hdu 2544 最短路
- 【July程序员编程艺术】之现场编写类似strstr/strcpy/strpbrk的函数
- windows上mysql的完全卸载
- Mac OSx下的APK反编译
- 快速排序 java实现
- java对象的内存布局
- HDU 2680 最短路
- IOS中 Block简介与用法(一)
- iperf测试吞吐量
- frameset下frame控制兄弟框架的显示与隐藏
- Android开发中需要注意的几点
- 集合 --- List
- RGB颜色表颜色 与 GdkColor 的对应关系
- mvc5
- Orchard基础整理