Tanks

All submissions for this problem are available.
Read problems statements in Mandarin Chinese, Russian and Vietnamese as well.
Chefland is under attack. The enemy forces are using powerful tanks to break Chefland's defense. The government wants to destroy the enemy tanks, but is unsure of their numbers. It has, therefore, requested the math whizs amongst the public (that's you guys!) to come out and help estimate how many tanks the enemy has. The government simulates the current situation to decide who has the best solution.
The government spies have gathered the following information about tanks and their production line:
 There are K different types of tanks.
 One production line can make only one type of tank.
 Two different production lines cannot make the same type of tank.
 When installing a production line, the enemy mathematicians have to setup the serial_id generator, which cannot be modified later.
 Difference between the serial_id's of any two tanks of the same type cannot exceed M.
The inventor of the serial_id generator wanted to make the serial numbers extremely difficult to guess, and so he built a tricky machine.
The machine is set up using the following three initial parameters.
 start_id is a nonnegative integer
 direction can be either increment or decrement
 sequence_type can be normal, prime, Ulam(1,2), or Ulam(2,3)
More details about the serial_id generator are provided later.
We can ask the Chefland government to capture a tank, and then provide us with the captured tank type and serial_id. The capture query can be:
 Capture a tank of type i (1 ≤ i ≤ K). This costs C_{i}.
 Special capture: capture a tank of any type. This operation has a cost C.
Every tank type has different armour, and therefore we need different kinds of bomb for each of them, which also have different prices (B_{i} for the bomb piercing the armor of the i^{th} tank type). After we finish the above scouting process, we need to provide the number (D_{i}) of bombs we need (for each type). Each bomb can destroy one tank (but the bomb completely annihilates the tank to little bits of scrap metal, so we can't extract any information from a destroyed tank.) If the enemy has R_{i} tanks remaining after the captures, and we ask for D_{i} bombs but R_{i} > D_{i}, than we have to pay P_{i} penalty for each remaining tank (after D_{i} of them have been destroyed).
The goal is to minimize the capture_cost + destroy_cost + penalty_cost:
 capture_cost: ∑ cost of capture operations
 destroy_cost: ∑ D_{i} * B_{i} (some over all tank types)
 penalty_cost: ∑ max((R_{i}  D_{i}) , 0) * P_{i} (sum over all tank types)
More detail about serial_id generator:
 normal sequence: 0, 1, 2, 3, … is the sequence of nonnegative integers.
 prime sequence: the i^{th} element is the (i^{th} prime number + 1) / 2 (integer division). So, the sequence is: 1, 2, 3, 4, 6 ….
 Ulam(1,2) sequence: 1, 2, 3, 5, …. You can read more about this sequence here.
 Ulam(2,3) sequence: 2, 3, 5, 7, ….
e.g. SerialGenerator(start_id = 12345, increasing, Ulam(1,2)) will produce the following serial_id's: 12346, 12347, 12348, 12350, 12352 ….
Note. This might help: German tank problem.
Input
The first line of input contains the integer M.
The second line of the input contains an integer U12, denoting the number of elements of the Ulam(1,2) sequence provided to you. The next U12 lines contain an integer each: such that the i^{th} line gives the i^{th} element of the Ulam(1,2) sequence. Each of these numbers is at most M + 1.
The following line contains an integer U23 denoting the number of Ulam(2,3) sequence provided to you. The next U23 lines contain an integer each. Each of these numbers is at most M + 2.
The following line of input contains an integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains two spacesepareated integers: K and C. This is followed by a line containing K spaceseparated integers: C_{1}, C_{2}, …, C_{K}. Similarly, the next two lines for the test case contain K spaceseparated integers each: the first line specifying the sequence B_{i}, and the second P_{i}.
Output
For each test case, the output should be as follows.
If you want to capture a tank, then just output a line with a nonnegative integer denoting the type of the tank you want captured, or 0 if you do not care about the type of the tank being captured.
You can keep on repeating the above request until desired. If you think you have enough information, then output 1 in a new line. This ends the scouting process. Of course, if you do not want to capture any tanks at all, then you can output this in the first line itself.
After scouting is finished, print a single line with K spaceseparated nonnegative integers denoting the sequence D_{i}. In case any D_{i} is negative, or exceeds M, then you will get a wrong answer verdict.
Interactivity details
This is an interactive challenge problem, so after you output the description of your capture request, flush the output buffer. In C++, you can do this with fflush(stdout); routine.
After you do it, you'll receive the capture tank type, and its serial_id. If there are no tanks of this type left, then you will get type 1 answer. (Also applies if the requested type is zero, and no more tanks are available to be captured.)
Constraints
The test cases for the problem are divided into 4 groups, each containing 5 test cases. Group 1: M = 10^{3}
 Group 2: M = 10^{4}
 Group 3: M = 10^{5}
 Group 4: M = 10^{6}
 T = 20
 0 < U12 , U23 < 100000
 3 ≤ K ≤ 20
 100 ≤ C ≤ 200
 C < C_{i} ≤ 3*C
 10 ≤ B_{i} ≤ C
 C_{i} < P_{i} ≤ 1000
 0 ≤ serial_id ≤ 10^{9}
Test Case Generation
The numbers of tanks, K, is chosen from the interval (3, 20). After that, for every type of tank, the following constants are generated uniformly and independently of the other tank types.
 C from (100, 200)
 C_{i} from (C+1, 3*C)
 10% of the test cases B_{i} from (10, C), 90% of the test cases B_{i} from (C/4, C)
 P_{i} from (C_{i}+1, 1000)
 sequence_type
 direction from {increment, decrement}
We choose start_id uniformly from (0, 10^{9}), and the number of tanks is chosen uniformly from the valid range. If one of the tanks' serial_id is not in the valid range (0, 10^{9}), then repeat this.
Capture requests work in the following way:
 All capture requests are independent of each other.
 If a particular tank type is requested, a tank is chosen randomly from the set of tanks of this type by uniform sampling.
 For special capture requests (when no tank type is given), first a probability distribution is constructed in which all the tank types which have at least one tank remaining have a probability inversely proportional to their usual capture cost, while types having no tanks remaining are ignored. Formally, p(class=i  i has at least one tank) ∝ 1/C_{i}), and p(class=i  i has no tank remaining) = 0. A tank type is selected by sampling this distribution, and then a tank of this type is chosen ramdonly and uniformly.
Scoring
The score calculated on a test case is:
( capture_cost + destroy_cost + penalty_cost ) / ( ∑(number of tanks of i^{th} type) * B_{i} ).
The score in one test file is the sum of the scores over all test cases. The total score of your solution is the sum of the scores for all the test files. During the contest, scores only for one test case per group (so, in total, at 4 test cases) are reported.
Example
Input: Initial input: 5 < M 5 < U12 1 2 3 4 6 4 < U23 2 3 5 7 1 < T 2 111 < K C 112 333 < C_{1} C_{2} 10 111 < B_{1} B_{2} 113 1000 < P_{1} P_{2} Let's assume the first type of enemy tanks has the generator with initial parameters (start_id = 11, increasing, normal). So, the serial id's are 11, 12. The second type of tank generator is (start_id = 234, decreasing, ulam12). So, the serial id's are 233, 232, 231. One possible output: 1 2 3 Destroy cost = 2 * 10 + 3 * 111 = 353, the other costs are 0, and you will get 1.0 score for this. Another possible solution / communication 0 < output : capture request 2 233 < input : type, serial_id 0 < output : capture request 1 11 < input : type, serial_id 1 < output : capture request 1 12 < input : type, serial_id 1 < output : capture request 1 1 < input : type, serial_id 1 < output : we don't need more information 0 1 < output : our guess capture_cost = 2 * 111 + 1 * 112 = 334 destroy_cost = 0 * 10 + 1 * 111 = 111 penalty_cost = 0 * 113 + 1 * 1000 = 1000 score = 1445 / (2*10 + 3 * 111) = 4.093
Author:  iscsi 
Tester:  xcwgf666 
Editorial  http://discuss.codechef.com/problems/TANKS 
Tags  iscsi 
Date Added:  19112015 
Time Limit:  4 sec 
Source Limit:  50000 Bytes 
Languages:  ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 6.3, CPP14, CS2, D, ERL, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYPY, PYTH, PYTH 3.5, RUBY, SCALA, SCM chicken, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 