HDU 1690 bus system

Link:

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1690

Question:

Bus System

Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)
Total submission (s): 4292 accepted submission (s): 1088


Problem failure 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.

Inputthe 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 not-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 <= 500, 0 <= m <= 1,000,000,000, each X-coordinate is between-1,000,000,000 and, and no two X-coordinates will have the same value.

Outputfor 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.

 

Source2008 "sunline Cup" national invitational contest

Analysis and Summary:

A water question, but wa seven times.

1. I accidentally wrote 0 <Dist & Dist <= L1 as 0 <Dist <= L1 = |. As a result, I couldn't call the example for a long time.

2. 64-bit int is not used

3. After using long, we found that we could not use AC. It was estimated that it was just amazing that Hangzhou power had changed all input and output to CIN and cout. Then I want to know why the direct scanf and printf processes long type wa. So I conducted an experiment and found the amazing secrets of HDU... You can use % LLD to input long, but the output must use the % i64d of _ in64 to be able to access the AC, indicating that HDU is paralyzed.
Then use _ int64 to find that the % LLD input can also be ac... [Note: The above is submitted using hdu c ++]

Code:

#include<iostream>#include<cstdio>#include<cstring>using namespace std;typedef long long int64;const int64 INF = 1e18;const int VN  = 105;int n;int m;int64 d[VN][VN];int64 X[VN];int64 L1,L2,L3,L4;int64 C1,C2,C3,C4;inline int64 abs(int64 x){return x<0?-x:x;}void init(){    for(int i=1; i<=n; ++i){        d[i][i] = 0;        for(int j=i+1; j<=n; ++j)            d[i][j]=d[j][i]=INF;    }}int64 getCost(int64 dist){    if(0<dist && dist<=L1) return C1;    if(L1<dist && dist<=L2) return C2;    if(L2<dist && dist<=L3) return C3;    if(L3<dist && dist<=L4) return C4;    return INF;}void Floyd(){    for(int k=1; k<=n; ++k)    for(int i=1; i<=n; ++i)if(d[i][k]!=INF)    for(int j=1; j<=n; ++j)if(d[k][j]!=INF)        d[i][j]=min(d[i][j], d[i][k]+d[k][j]);}int main(){    int T,cas=1;    scanf("%d",&T);    while(T--){        cin >> L1 >> L2 >> L3 >> L4;        cin >> C1 >> C2 >> C3 >> C4;        scanf("%d%d",&n,&m);        for(int i=1; i<=n; ++i)            cin >> X[i];        init();        for(int i=1; i<=n; ++i){            for(int j=i+1; j<=n; ++j){                d[i][j]=d[j][i]=getCost(abs(X[i]-X[j]));            }        }        Floyd();        int u,v;        printf("Case %d:\n",cas++);        for(int i=0; i<m; ++i){            scanf("%d%d",&u,&v);            if(d[u][v]!=INF){                printf("The minimum cost between station %d and station %d is ",u,v);                cout << d[u][v] << ".\n";            }            else                 printf("Station %d and station %d are not attainable.\n",u,v);        }    }    return 0;}

 
  
-- The meaning of life is to give it meaning.
  

   Original
   Http://blog.csdn.net/shuangde800
   , By d_double (reprinted, please mark)