CISTFILL - Fill the Cisterns

During the next century certain regions on earth will experience severe water shortages. The old town of Uqbar has already started to prepare itself for the worst. Recently they created a network of pipes connecting the cisterns that distribute water in each neighbourhood, making it easier to fill them at once from a single source of water. But in case of water shortage the cisterns above a certain level will be empty since the water will flow to the cisterns below.

Example of cistern arrangement

You have been asked to write a program to compute the level to which cisterns will be filled with a certain volume of water, given the dimensions and position of each cistern. To simplify we will neglect the volume of water in the pipes.


Write a program that:

  • reads the description of cisterns and the volume of water,
  • computes the level to which the cisterns will be filled with the given amount of water,
  • writes the result.


The first line of the input contains the number of data sets k, 1 <= k <= 30. The data sets follow.

The first line of each data set contains one integer n, the number of cisterns, 1 <= n <= 50000. Each of the following n lines consists of 4 nonnegative integers, separated by single spaces: b, h, w, d - the base level of the cistern, its height, width and depth in meters, respectively. The integers satisfy 0 <= b <= 106 and 1 <= h*w*d <= 40000. The last line of the data set contains an integer V - the volume of water in cubic meters to be injected into the network. Integer V satisfies 1 <= V <= 2*109.


The output should consist of exactly d lines, one line for each data set. Line i, 1 <= i <= d, should contain the level that the water will reach, in meters, rounded to two fractional digits, or the word "OVERFLOW" (without quotes), if the volume of water exceeds the total capacity of the cisterns.


Sample input:
0 1 1 1 
2 1 1 1 
11 7 5 1 
15 6 2 2 
5 8 5 1 
19 4 8 1 
11 7 5 1 
15 6 2 2 
5 8 5 1 
19 4 8 1 

Sample output:
Warning: enormous Input/Output data, be careful with certain languages

hide comments
George: 2012-11-26 14:40:12

I get accepted with precision 1e-4 and 'printf(".2f\n", ans);'. Please, correct problem text, I got WA several times with 'ceil'.

Last edit: 2012-11-26 14:40:27
Saurav Shekhar: 2012-10-23 13:29:09

rounded up is wrong rounded off should be there

~!(*(@*!@^&: 2010-04-21 06:48:09

epsilon = 1e-3 is enough

EDIT: nope it is not enough, needed at least 1e-6 to get enough precission to say that they are equal, otherwise i could not (i got AC first try with 1e-8 and WA after that with 1e-4 trying what this user said)

Last edit: 2012-08-08 20:00:38

Added by:adrian
Time limit:13s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Resource:ACM Central European Programming Contest, Warsaw 2001