HDU 1690 Bus System

时间：2014-08-29 18:07:58 阅读：177 评论：0 收藏：0 [点我收藏+]

标签：des style blog http color os java io ar

Bus System

Time Limit: 1000ms

Memory Limit: 32768KB

This problem will be judged on HDU. Original ID: 1690
64-bit integer IO format: %I64d Java class name: Main

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.

bubuko.com,布布扣

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.

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

2
1 2 3 4 1 3 5 7
4 2
1
2
3
4
1 4
4 1
1 2 3 4 1 3 5 7
4 1
1
2
3
10
1 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.

Source

2008 “Sunline Cup” National Invitational Contest

解题：Floyd算法

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <stack>
13 #define LL long long
14 #define pii pair<int,int>
15 #define INF 0x3f3f3f3f3f3fLL
16 using namespace std;
17 LL L[4],C[4],n,m;
18 LL x[110],mp[110][110];
19 LL calc(int i,int j){
20     LL tmp = x[i] - x[j];
21     if(tmp < 0) tmp = -tmp;
22     if(tmp > 0 && tmp <= L[0]) return C[0];
23     if(tmp > L[0] && tmp <= L[1]) return C[1];
24     if(tmp > L[1] && tmp <= L[2]) return C[2];
25     if(tmp > L[2] && tmp <= L[3]) return C[3];
26     return INF;
27 }
28 int main() {
29     int t,i,j,k,u,v,cs = 1;
30     scanf("%d",&t);
31     while(t--){
32         for(i = 0; i < 4; i++) scanf("%I64d",L+i);
33         for(i = 0; i < 4; i++) scanf("%I64d",C+i);
34         scanf("%I64d %I64d",&n,&m);
35         for(i = 1; i <= n; i++) scanf("%I64d",x+i);
36         for(i = 1; i <= n; i++){
37             mp[i][i] = INF;
38             for(j = i+1; j <= n; j++){
39                 mp[i][j] = mp[j][i] = calc(i,j);
40             }
41         }
42         for(k = 1; k <= n; k++){
43             for(i = 1; i <= n; i++){
44                 for(j = 1; j <= n; j++){
45                     if(mp[i][j] > mp[i][k]+mp[k][j])
46                         mp[i][j] = mp[i][k] + mp[k][j];
47                 }
48             }
49         }
50         printf("Case %d:\n",cs++);
51         while(m--){
52             scanf("%d %d",&u,&v);
53             if(mp[u][v] >= INF){
54                 printf("Station %d and station %d are not attainable.\n",u,v);
55             }else{
56                 printf("The minimum cost between station %d and station %d is %I64d.\n",u,v,mp[u][v]);
57             }
58         }
59     }
60     return 0;
61 }

View Code

HDU 1690 Bus System

标签：des style blog http color os java io ar

原文地址：http://www.cnblogs.com/crackpotisback/p/3945397.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行