| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 128 MB | 24 | 8 | 7 | 33.333% |
John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25), L1, ..., Ln, 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 i = 1, ..., n-1, the number of 5-minute intervals it takes to travel from Li to Li+1 is denoted ti (0 < ti <= 192). For example, t3 = 4 means that it takes 20 minutes to travel from L3 to L4
To help plan his fishing trip, he has gathered some information about the lakes. For each lake Li, the number of fish expected to be caught in the initial 5 minutes, denoted Fi (Fi >= 0), 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 di (di >= 0). If the number of fish expected to be caught in an interval is less than di, 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 in the lakes.
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 fishing at each lake must be a multiple of 5.
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. This is followed by a line of n integers specifying Fi (i = 1, ..., n), followed by a line of n integers di (i = 1, ..., n), and finally, a line of n-1 integers ti (i = 1, ..., n-1). Input is terminated by a case in which n = 0.
For each test case, print the number of minutes spent fishing 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 L1, 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 L2, and so on. Insert a blank line between cases.
2 1 10 1 2 5 2 4 4 10 15 20 17 0 3 4 3 1 2 3 4 4 10 15 50 30 0 3 4 3 1 2 3 0
45, 5 Number of fish expected: 31 240, 0, 0, 0 Number of fish expected: 480 115, 10, 50, 35 Number of fish expected: 724