HDU 1690 Bus System(Floyd)
来源:互联网 发布:极客学院java百度网盘 编辑:程序博客网 时间:2024/06/07 09:38
Bus System
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8999 Accepted Submission(s): 2444
Problem Description
Because of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s still playing an important role even now.
The bus system of City X is quite strange. Unlike other city’s system, the cost of ticket is calculated based on the distance between the two stations. Here is a list which describes the relationship between the distance and the cost.
Your neighbor is a person who is a really miser. He asked you to help him to calculate the minimum cost between the two stations he listed. Can you solve this problem for him?
To simplify this problem, you can assume that all the stations are located on a straight line. We use x-coordinates to describe the stations’ positions.
The bus system of City X is quite strange. Unlike other city’s system, the cost of ticket is calculated based on the distance between the two stations. Here is a list which describes the relationship between the distance and the cost.
Your neighbor is a person who is a really miser. He asked you to help him to calculate the minimum cost between the two stations he listed. Can you solve this problem for him?
To simplify this problem, you can assume that all the stations are located on a straight line. We use x-coordinates to describe the stations’ positions.
Input
The input consists of several test cases. There is a single number above all, the number of cases. There are no more than 20 cases.
Each case contains eight integers on the first line, which are L1, L2, L3, L4, C1, C2, C3, C4, each number is non-negative and not larger than 1,000,000,000. You can also assume that L1<=L2<=L3<=L4.
Two integers, n and m, are given next, representing the number of the stations and questions. Each of the next n lines contains one integer, representing the x-coordinate of the ith station. Each of the next m lines contains two integers, representing the start point and the destination.
In all of the questions, the start point will be different from the destination.
For each case,2<=N<=100,0<=M<=500, each x-coordinate is between -1,000,000,000 and 1,000,000,000, and no two x-coordinates will have the same value.
Each case contains eight integers on the first line, which are L1, L2, L3, L4, C1, C2, C3, C4, each number is non-negative and not larger than 1,000,000,000. You can also assume that L1<=L2<=L3<=L4.
Two integers, n and m, are given next, representing the number of the stations and questions. Each of the next n lines contains one integer, representing the x-coordinate of the ith station. Each of the next m lines contains two integers, representing the start point and the destination.
In all of the questions, the start point will be different from the destination.
For each case,2<=N<=100,0<=M<=500, each x-coordinate is between -1,000,000,000 and 1,000,000,000, and no two x-coordinates will have the same value.
Output
For each question, if the two stations are attainable, print the minimum cost between them. Otherwise, print “Station X and station Y are not attainable.” Use the format in the sample.
Sample Input
21 2 3 4 1 3 5 74 212341 44 11 2 3 4 1 3 5 74 1123101 4
Sample Output
Case 1:The minimum cost between station 1 and station 4 is 3.The minimum cost between station 4 and station 1 is 3.Case 2:Station 1 and station 4 are not attainable.
最短路数据开—int 64否则wa inf要开1e18否则wa Floyd和dijkstra之类的问题主要是如何建立一个map[][]的图建立
Floyd的做法:
#include <stdio.h>#include<algorithm>#include<string.h>using namespace std;const __int64 inf = 1e18;__int64 map[105][105];__int64 flag=1;int main(int argc, char *argv[]){__int64 t,i,j;__int64 len[5],c[5];__int64 x[500];scanf("%I64d",&t);while(t--){for(i=0;i<=100;i++){for(j=0;j<=100;j++){map[i][j]=inf;}map[i][i]=0;}for(i=1;i<5;i++)scanf("%I64d",&len[i]);for(i=1;i<5;i++)scanf("%I64d",&c[i]);;__int64 m,n;scanf("%I64d %I64d",&n,&m);for(i=1;i<=n;i++){scanf("%I64d",&x[i]);} __int64 a;for(i=1;i<=n-1;i++){for(j=i+1;j<=n;j++){a=abs(x[j]-x[i]);if(a>0&&a<=len[1])map[i][j]=map[j][i]=c[1];if(a>len[1]&&a<=len[2])map[i][j]=map[j][i]=c[2];if(a>len[2]&&a<=len[3])map[i][j]=map[j][i]=c[3];if(a>len[3]&&a<=len[4])map[i][j]=map[j][i]=c[4];else if(a>len[4]){map[i][j]=map[j][i]=inf;}}}__int64 k;for(k=1;k<=n;k++){for(i=1;i<=n;i++){for(j=1;j<=n;j++){map[i][j]=min(map[i][j],map[i][k]+map[k][j]);}}}printf("Case %I64d:\n",flag++);while(m--){__int64 c,d;scanf("%I64d %I64d",&c,&d);if(map[c][d]!=inf)printf("The minimum cost between station %I64d and station %I64d is %I64d.\n",c,d,map[c][d]);elseprintf("Station %I64d and station %I64d are not attainable.\n",c,d);}}return 0;}
阅读全文
0 0
- hdu 1690 Bus System--floyd
- hdu 1690 Bus System ---Floyd
- HDU 1690 Bus System(Floyd)
- 【HDU】1690 Bus System 【floyd】
- hdu 1690 Bus System【floyd】
- HDU 1690 Bus System(Floyd)
- Bus System hdu 1690 Floyd的基本
- hdu 1690 Bus System Floyd 求最短路径
- hdu 1690 Bus System(Floyd)
- HDU 1690 Bus System(Floyd)
- hdu 1690 题意 Bus System floyd
- HDU-1690 Bus System(Floyd)
- hdu Bus System(floyd)
- hdu 1690 Bus System 最短路(dijkstra+floyd)
- hdu 1690 Bus System (Floyd,spfa 没一直wa)
- hdu 1690——Bus System floyd 算法
- HDU 1690(Bus System) 最短路(SPFA&&FLOYD)
- HDU 1690 Bus System 任意点最短路径Floyd
- 布局随笔
- JAVA操作HBASE数据操作详解
- Java中的Filter过滤器
- 算法导论习题自作2.1-2
- 【JZOJ5296】【清华集训模拟】Sequence(整体二分)
- HDU 1690 Bus System(Floyd)
- 浅谈对handle的理解
- ZigBee CC2530 Z-Stack 19 单播通信2-64位地址模式
- CDN是什么?使用CDN有什么优势?
- URL、SRC、href之间的区别
- scala隐式转换函数
- Docker安装Nginx环境
- 进程间通信的方式
- 初步认识JVM