PAT-A1033. To Fill or Not to Fill (25)

1033. To Fill or Not to Fill (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

ZHANG, Guochuan

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: C_max (<= 100), the maximum capacity of the tank; D (<=30000), the distance between Hangzhou and the destination city; D_avg (<=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: P_i, the unit gas price, and D_i (<=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>
#include<stdio.h>


using namespace std;


struct station
{
	double price, dis;
}sta[510];


int cmp(station s1, station s2)
{
	return s1.dis < s2.dis;
}


int main()
{
	int n;
	double Cmax, D, cus;
	cin >> Cmax >> D >> cus >> n;


	for (int i = 0; i < n; i++)
	{
		cin >> sta[i].price >> sta[i].dis;
	}


	sta[n].price = 0;
	sta[n].dis = D;
	sort(sta, sta + n, cmp);
	
	if (sta[0].dis != 0)
		cout << "The maximum travel distance = 0.00" << endl;
	else
	{
		int now = 0;
		double  nowtank = 0, cost = 0, max = Cmax*cus;
		while (now < n)
		{
			int k = -1;
			double minprice = 100000;
			for (int i = now + 1; i <= n&&sta[now].dis + max >= sta[i].dis; i++)
			{
				if (sta[i].price < minprice)
				{
					k = i;
					minprice = sta[i].price;
				}


				if (minprice < sta[now].price)
				{
					k = i;
					break;
				}


			}


			if (k == -1)
				break;


			double need = (sta[k].dis - sta[now].dis) / cus;


			if (sta[k].price < sta[now].price)
			{
				cost += (need - nowtank)*sta[now].price;
				nowtank = 0;
			}
			else
			{
				cost += (Cmax - nowtank)*sta[now].price;
				nowtank = Cmax - need;
			}


			now = k;
		}


		if (now == n)
		{
			printf("%.2lf", cost);
		}
		else
		{
			printf("The maximum travel distance = %.2lf\n", sta[now].dis + max);
		}
	}


	system("pause");
	return 0;


}