POJ 1042 Gone Fishing: 枚举&贪心&想法题&优先队列

UVa 757 / POJ 1042 Gone Fishing: 枚举&贪心&想法题&优先队列2014-07-08 synapse7 757 - Gone Fishing

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php？option=com_onlinejudge&Itemid=8&page=show_problem&problem=698

http://poj.org/problem？id=1042

John is going on a fishing trip. He has h hours available （

）, and there are n lakes in the area （

） all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from one lake to the next one, but he does not have to stop at any lake unless he wishes to. For each

, the number of 5-minute intervals it takes to travel from lakei to lake i + 1 is denoted t_i （

）. For example, t₃ = 4 means that it takes 20 minutes to travel from lake 3 to lake 4.

To help plan his fishing trip, John has gathered some information about the lakes. For each lake i, the number of fish expected to be caught in the initial 5 minutes, denoted f_i （

）, is known. Each 5 minutes of fishing decreases the number of fish expected to be caught in the next 5-minute interval by a constant rate of d_i （

）. If the number of fish expected to be caught in an interval is less than or equal to d_i, there will be no more fish left in the lake in the next interval. To simplify the planning, John assumes that no one else will be fishing at the lakes to affect the number of fish he expects to catch.

Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught. The number of minutes spent at each lake must be a multiple of 5.

Input

You will be given a number of cases in the input. Each case starts with a line containing n. This is followed by a line containing h. Next, there is a line of n integers specifying f_i （

）, then a line of n integers d_i （

）, and finally, a line of n - 1 integers t_i （）. Input is terminated by a case in which n = 0.

Output

For each test case, print the number of minutes spent at each lake, separated by commas, for the plan achieving the maximum number of fish expected to be caught （you should print the entire plan on one line even if it exceeds 80 characters）. This is followed by a line containing the number of fish expected. If multiple plans exist, choose the one that spends as long as possible at lake 1, even if no fish are expected to be caught in some intervals. If there is still a tie, choose the one that spends as long as possible at lake 2, and so on. Insert a blank line between cases.

Sample Input

2110 12 524410 15 20 170 3 4 31 2 34410 15 50 300 3 4 31 2 30

Sample Output

45, 5Number of fish expected: 31240, 0, 0, 0Number of fish expected: 480115, 10, 50, 35Number of fish expected: 724

首先枚举去哪些湖钓鱼。

由于每个湖中鱼的数量只与钓了多长时间有关，与什么时候钓无关。因此我们可以一次将移动的时间全部扣除，这样每时每刻我们都可以选择鱼数量最多的湖。