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.
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.
Task
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.
Input
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 <= 10^{6} 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*10^{9}.
Output
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.
Example
Sample input: 3 2 0 1 1 1 2 1 1 1 1 4 11 7 5 1 15 6 2 2 5 8 5 1 19 4 8 1 132 4 11 7 5 1 15 6 2 2 5 8 5 1 19 4 8 1 78 Sample output: 1.00 OVERFLOW 17.00Warning: enormous Input/Output data, be careful with certain languages
hide comments
abhinav_jain02:
20190518 09:34:49
Simple, make an array with elements equal to start depth and end depth from the bottom. Sort the array by depth. Fill the cisterns from the bottom. Keep increasing or decreasing the net area to be filled. No binary search required. 

manoj9april:
20180203 16:40:53
Last edit: 20180203 16:41:26 

blaskwolf:
20170721 16:39:48
nvmfound my mistake Last edit: 20170721 17:16:13 

kshubham02:
20170317 17:02:02
epsilon = 1e6 gives WA. 1e7 gives AC. Insane :/ 

Siddhartha Gairola:
20160616 13:20:57
so is height = length, width = breadth and depth = height ?


nikita204:
20160614 12:18:56
Why do we need to use epsilon? 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20150827 21:13:21
tricky floating point problem *_* 

eightnoteight:
20150605 13:25:30
misdirecting problem statement;


George:
20121126 14:40:12
I get accepted with precision 1e4 and 'printf(".2f\n", ans);'. Please, correct problem text, I got WA several times with 'ceil'. Last edit: 20121126 14:40:27 

Saurav Shekhar:
20121023 13:29:09
rounded up is wrong rounded off should be there 
Added by:  adrian 
Date:  20040702 
Time limit:  13s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  ACM Central European Programming Contest, Warsaw 2001 