PAT 甲级 1033 To Fill or Not to Fill (25 分) 贪心-蒲公英云

PAT 甲级 1033 To Fill or Not to Fill (25 分) 贪心

电玩女神 2024-02-19 21:51 117阅读 0赞

1033 To Fill or Not to Fill (25 分)

With highways available, driving a car from Hangzhou to any other city is easy. But since the tank capacity of a car is limited, we have to find gas stations on the way from time to time. Different gas station may give different price. You are asked to carefully design the cheapest route to go.

Input Specification:

Each input file contains one test case. For each case, the first line contains 4 positive numbers: Cmax (≤ 100), the maximum capacity of the tank; D (≤30000), the distance between Hangzhou and the destination city; Davg (≤20), the average distance per unit gas that the car can run; and N (≤ 500), the total number of gas stations. Then N lines follow, each contains a pair of non-negative numbers: Pi, the unit gas price, and Di (≤D), the distance between this station and Hangzhou, for i=1,⋯,N. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the cheapest price in a line, accurate up to 2 decimal places. It is assumed that the tank is empty at the beginning. If it is impossible to reach the destination, print The maximum travel distance = X where X is the maximum possible distance the car can run, accurate up to 2 decimal places.

Sample Input 1:

50 1300 12 8
6.00 1250
7.00 600
7.00 150
7.10 0
7.20 200
7.50 400
7.30 1000
6.85 300

Sample Output 1:

749.17

Sample Input 2:

50 1300 12 2
7.10 0
7.00 600

Sample Output 2:

The maximum travel distance = 1200.00

这题是看了宝典才有思路的。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
    double price;
    double dis;
};
struct car{
    double account;
    double sum;
    car()
    {
        account=0;
        sum=0;
    }
};
int cmp(node a,node b)
{
    return a.dis<b.dis;
}
int main()
{
    double count,distance,run;
    int n;
    car s;
    node a[502];
    int i,j,k=0;
    scanf("%lf %lf %lf %d",&count,&distance,&run,&n);
    for(i=0;i<n;i++)
    scanf("%lf %lf",&a[i].price,&a[i].dis);
    a[n].price=0;
    a[n].dis=distance;
    sort(a,a+n,cmp);
    if(a[0].dis!=0)    //如果不是从0开始的， 则不能到达 
    {
        printf("The maximum travel distance = %.2lf\n",0);
    }
    else
    {
        k=0;
        for(i=k;i<n;)
        {
            int miner=-1;
            double min_p=0x3f3f3f3f;
            for(j=i+1;j<=n&&a[j].dis<=a[i].dis+count*run;j++)
            {
                if(a[j].price<min_p)
                {
                    min_p=a[j].price;
                    miner=j;
                    if(min_p<a[i].price)    // 如果找到比当前油价更低而且是最近的加气站，就跳出循环 
                    {
                        break;
                    }
                }
            }
            if(miner==-1)    //如果没找到 符合条件的气站  ，退出循环 
            break;
            double need=(a[miner].dis-a[i].dis)/run*1.0;     //算出到下一个气站需要的油量。 
            if(a[miner].price<a[i].price)  // 如果找到比当前油价更低而且是最近的加气站
            {
                if(s.account<need)   // 如果此时油箱的油不够 
                {
                    s.sum+=(need-s.account)*a[i].price;  // 加到能到目的加气站的油量 
                    s.account=0;  // 记得要清零 ，而且顺序别错了 
                } 
                else            // 如果够的话 ，就减去。 
                {
                    s.account-=need;
                }
            }
            else      // 如果没找到符合条件的加气站，那就在当前站加满 
            {
                s.sum+=(count-s.account)*a[i].price;
                s.account=(count-need);
            }
            i=miner;  // 更新当前加气站 
//            cout<<a[i].price<<" "<<a[i].dis<<" "<<s.sum<<endl;
        }
        if(i==n)
        printf("%.2lf\n",s.sum);
        else
        printf("The maximum travel distance = %.2lf\n",a[i].dis+count*run);
    }
    return 0;
 }