【PAT 1033】 To Fill or Not to Fill 贪心算法&模拟

最新推荐文章于 2025-02-06 13:05:50 发布

tiantangrenjian

最新推荐文章于 2025-02-06 13:05:50 发布

阅读量6.4k

点赞数 2

CC 4.0 BY-SA版权

分类专栏：贪心模拟算法

本文链接：https://blog.youkuaiyun.com/tiantangrenjian/article/details/19175831

该博客主要介绍了PAT 1033题目，内容涉及从杭州出发到达目的地的最经济路线规划。通过分析输入的汽车油箱容量、平均油耗、加油站数量及价格、距离等信息，采用贪心算法来确定在每个加油站的最优加油策略，以达到最低费用。文章提及存在一个测试用例未通过，作者期待读者帮助找出问题所在。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1033. To Fill or Not to Fill (25)

时间限制

10 ms

内存限制

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