HDU2145 zz's Mysterious Present 解题报告 ——最短路dijkstra算法
来源:互联网 发布:qq飞车青峰剃刀数据 编辑:程序博客网 时间:2024/06/06 20:01
zz's Mysterious Present
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 854 Accepted Submission(s): 171
Problem Description
There are m people in n cities, and they all want to attend the party which hold by zz. They set out at the same time, and they all will choose the best way they think, but due to someone take a ride, someone drive, and someone take a taxi, they have different speed. Can you find out who will get zz's mysterious present? The first one get the party will get the present . If there are several people get at the same time, the one who stay in the city which is farther from the city where is zz at begin will get the present. If there are several people get at the same time and the distance from the city he is at begin to the city where zz is, the one who has the larger number will get the present.
Input
The first line: three integers n, m and k. m is the total number of the people, and n is the total number of cities, and k is the number of the way.(0<n<=300, 0<m<=n, 0<k<5000)
The second line to the (k+1)th line: three integers a, b and c. There is a way from a to b, and the length of the way is c.(0<a,b<=n, 0<c<=100)
The (k+2)th line: one integer p(0<p<=n), p is the city where zz is.
The (k+3)th line: m integers. the ith people is at the place p[i] at begin.(0<p[i]<=n)
The (k+4)th line: m integers. the speed of the ith people is speed[i];(0<speed[i]<=100)
All the ways are directed.
The second line to the (k+1)th line: three integers a, b and c. There is a way from a to b, and the length of the way is c.(0<a,b<=n, 0<c<=100)
The (k+2)th line: one integer p(0<p<=n), p is the city where zz is.
The (k+3)th line: m integers. the ith people is at the place p[i] at begin.(0<p[i]<=n)
The (k+4)th line: m integers. the speed of the ith people is speed[i];(0<speed[i]<=100)
All the ways are directed.
Output
For each case, output the one who get the present in one line. If no one can get the present, output "No one".
Sample Input
3 1 31 2 21 3 32 3 1321
Sample Output
1
这道题在最短路的基础上加入了速度和时间,可以直接将终点P看为起点,便可以用Dijkstra解题。
因为题目说明所以路是有向的,所以输入时应注意顺序。
#include<stdio.h>#include<string.h>const long inf =999999999;int map[301][301];doubletime[301];int speed[301];int pla[301];int p;long dis[301];void Dijkstra(int p,int n){bool used[301]={false};long min,next;memset(dis,-1,sizeof(dis));dis[p]=0;for(long i=1;i<=n;i++){min=inf;for(long j=1;j<=n;j++)if(!used[j] && dis[j]!=-1 && dis[j]<min){min=dis[j];next=j;}if(min!=inf){used[next]=true;for(long j=1;j<=n;j++)if(!used[j] && map[next][j]!=-1 && (dis[j]>map[next][j]+dis[next] || dis[j]==-1))dis[j]=map[next][j]+dis[next];}}}int main(void){int n,m,k;//city,peo,wayint o,p,q;//xunhuanint a,b,c;//inputwhile(scanf("%d %d %d",&n,&m,&k)!=EOF){for(o=1;o<=n;++o)for(p=1;p<=n;++p)map[o][p]=inf;for(o=1;o<=k;o++){scanf("%d %d %d",&a,&b,&c);if(map[b][a]>c){map[b][a]=c;}}scanf("%d",&p);Dijkstra(p,n);long min=1;for(o=1;o<=m;++o)scanf("%d",&pla[o]);for(o=1;o<=m;++o)scanf("%d",&speed[o]);for(o=1;o<=m;++o){time[o]=((double)(dis[pla[o]])/(double)(speed[o]));if(time[min]>time[o])min=o;else if(time[min]==time[o]){if(dis[pla[min]]<=dis[pla[o]])min=o;}}if(dis[pla[min]]==inf)printf("No one\n");elseprintf("%d\n",min);}return 0;}
- HDU2145 zz's Mysterious Present 解题报告 ——最短路dijkstra算法
- HDU2145 zz's Mysterious Present(最短路)
- HDU - 2145 zz's Mysterious Present (最短路)
- Hdu 2145 zz's Mysterious Present 解题分析
- 【最短路径-Dis】hdu 2145 zz's Mysterious Present
- HDU 2145 zz's Mysterious Present(SFPA最短路径)
- HDU1874 畅通工程续 解题报告--最短路dijkstra算法
- hdu 2145 zz's Mysterious Present
- HDU 2145 zz's Mysterious Present
- 【HDU】2145 zz's Mysterious Present
- hdu 2145 zz's Mysterious Present
- HDU2544 最短路 解题报告--Dijkstra
- hdu2544 最短路(Dijkstra) 解题报告
- [ZZ]最短路的算法---Dijkstra算法
- 【解题报告】HDU 1874 畅通工程续 -- Dijkstra算法详解 单源点最短路问题
- 【解题报告】 POJ 1556 The Doors -- 最短路问题 Dijkstra算法 + 直线相交
- 最短路问题——Dijkstra算法
- POJ1847 Tram ACM解题报告(dijkstra求最短路)
- iOS(1): iOS7 隐藏Status Bar
- java帮助文档 JDK帮助文档(chm版) (所有版本提供下载)
- Java中Array与ArrayList的主要区别
- Java JSON Tutorial
- 平庸的程序员-个人履历
- HDU2145 zz's Mysterious Present 解题报告 ——最短路dijkstra算法
- HDU 1232 (简单并查集 查连通分支 13.10.30)
- const 如何实现
- MyBatis 3 – Spring integration tutorial
- 响应式的列布局
- 在VC6中添加svn插件
- linux命令使用记录
- Spring MVC 3 Controller for MyBatis CRUD operation
- JAVA垃圾回收机制