1033. To Fill or Not to Fill (25)
来源:互联网 发布:淘宝抵用券使用说明 编辑:程序博客网 时间:2024/06/11 04:30
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 86.00 12507.00 6007.00 1507.10 07.20 2007.50 4007.30 10006.85 300Sample Output 1:
749.17Sample Input 2:
50 1300 12 27.10 07.00 600Sample Output 2:
The maximum travel distance = 1200.00
#include<iostream>#include<vector>#include<algorithm>#include<iomanip>using namespace std;struct station{double len;//the distance between this station and Hangzhoudouble price;//the unit gas pricebool operator < (const station &s) const{return len<s.len;}};//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//N (<= 500): the total number of gas stationsint Cmax,D,Davg,N;vector<station> gasStation;double cost=0;//贪心策略://假设我们现在在A点,A能到达的最远距离之内有B、C、D三个点//1、如果B、C、D中有油价比A小的,则找到离A最近的,在A处加的油刚好到该处//2、如果B、C、D中没有油价比A小的,则找到这里面油价最小的,在A处加满void mincost(int curStation,double leftgas){if((curStation<N-1 && gasStation[curStation+1].len-gasStation[curStation].len>Cmax*Davg)|| (curStation==N-1 && D-gasStation[curStation].len>Cmax*Davg)){ //当前站到下一站的距离大于汽车满油能跑的距离,故无法到达终点cout<< "The maximum travel distance = "<<fixed<<setprecision(2)<<gasStation[curStation].len+Cmax*Davg<<endl;return;}double minPrice=65535;int i,index=curStation,flag=0;for(i=curStation+1;i<N && gasStation[i].len-gasStation[curStation].len<=Cmax*Davg;++i){if(gasStation[i].price<minPrice){ //寻找最大里程范围内最便宜的,如果有比当前站更便宜的直接跳出minPrice=gasStation[i].price;index=i;if(minPrice<gasStation[curStation].price){flag=1; break;}}}if(flag){ //如果B、C、D中有油价比A小的,则找到离A最近的,在A处加的油刚好到该处cost += gasStation[curStation].price*((gasStation[index].len-gasStation[curStation].len)/Davg-leftgas);mincost(index,0);}else{ //如果B、C、D中没有油价比A小的,则找到这里面油价最小的,在A处加油if(D-gasStation[curStation].len<=Cmax*Davg){ //如果此站可到达终点,则加上刚好到达终点的油,输出价格cost += gasStation[curStation].price*((D-gasStation[curStation].len)/Davg-leftgas);cout<<fixed<<setprecision(2)<<cost;return;}else{cost += gasStation[curStation].price*(Cmax-leftgas);mincost(index,Cmax-(gasStation[index].len-gasStation[curStation].len)/Davg);}}}int main(){cin>>Cmax>>D>>Davg>>N;for(int i=0;i<N;++i){station s;cin>>s.price>>s.len;gasStation.push_back(s);}sort(gasStation.begin(),gasStation.end());int dis=0;//the current distanceint gas=0;//the current gas leftif(gasStation[0].len>0)cout<< "The maximum travel distance = 0.00" <<endl;elsemincost(0,0);return 0;}
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- *1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill
- 1033. To Fill or Not to Fill (25)
- 1033. To Fill or Not to Fill (25)-PAT
- 【PAT】1033. To Fill or Not to Fill (25)
- 1033. To Fill or Not to Fill (25)
- PAT 1033. To Fill or Not to Fill (25)
- 1033. To Fill or Not to Fill (25)
- PAT 1033. To Fill or Not to Fill (25)
- PAT A 1033. To Fill or Not to Fill (25)
- PAT 1033. To Fill or Not to Fill (25)(贪心)
- WP开发入门指南:如何学习WP开发?
- 自定义Java类加载器的实现
- 1032. Sharing (25)
- Python语言计算1到10中偶数项的和
- DOM之下拉select复习
- 1033. To Fill or Not to Fill (25)
- Picasso扩展库
- 图集 html字段 文本颜色 错误
- 1034. Head of a Gang (30)
- Python 集合
- HDU 1874 求最短路径 Floyd 算法
- POJ 题目2377 Bad Cowtractors(最大生成树)
- 两个数的最大公约数
- 1035. Password (20)