当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1982:Water Tank

题目描述
Mr. Denjiro is a science teacher. Today he has just received a specially ordered water tank that will certainly be useful for his innovative experiments on water flow.

Figure 1: The water tank

The size of the tank is 100cm (Width) * 50cm (Height) * 30cm (Depth) (see Figure 1). For the experiments, he fits several partition boards inside of the tank parallel to the sideboards. The width of each board is equal to the depth of the tank, i.e. 30cm. The height of each board is less than that of the tank, i.e. 50 cm, and differs one another. The boards are so thin that he can neglect the thickness in the experiments.

Figure 2: The front view of the tank

The front view of the tank is shown in Figure 2.

There are several faucets above the tank and he turns them on at the beginning of his experiment. The tank is initially empty. Your mission is to write a computer program to simulate water flow in the tank.
输入解释
The input consists of multiple data sets. D is the number of the data sets.

D
DataSet1
DataSet2
...
DataSetD

The format of each data set (DataSetd , 1 <= d <= D) is as follows.

N
B1 H1
B2 H2
...
BN HN
M
F1 A1
F2 A2
...
FM AM
L
P1 T1
P2 T2
...
PL TL

Each line in the data set contains one or two integers.

N is the number of the boards he sets in the tank . Bi and Hi are the x-position (cm) and the height (cm) of the i-th board, where 1 <= i <= N .

Hi s differ from one another. You may assume the following.

0 < N < 10 ,
0 < B1 < B2 < ... < BN < 100 ,
0 < H1 < 50 , 0 < H2 < 50 , ..., 0 < HN < 50.
M is the number of the faucets above the tank . Fj and Aj are the x-position (cm) and the amount of water flow (cm3/second) of the j-th faucet , where 1 <= j <= M .

There is no faucet just above any boards . Namely, none of Fj is equal to Bi .

You may assume the following .


0 < M <10 ,
0 < F1 < F2 < ... < FM < 100 ,
0 < A1 < 100, 0 < A2 < 100, ... 0 < AM < 100.
L is the number of observation time and location. Pk is the x-position (cm) of the k-th observation point. Tk is the k-th observation time in seconds from the beginning.

None of Pk is equal to Bi .

You may assume the following .

0 < L < 10 ,
0 < P1 < 100, 0 < P2 < 100, ..., 0 < PL < 100 ,
0 < T1 < 1000000, 0 < T2 < 1000000, ... , 0 < TL < 1000000.
输出解释
For each data set, your program should output L lines each containing one real number which represents the height (cm) of the water level specified by the x-position Pk at the time Tk.

Round the answer to 3 digits after the decimal point.

After the water tank is filled to the brim, the water level at any Pk is equal to the height of the tank, that is, 50 cm.
输入样例
2
5
15 40
35 20
50 45
70 30
80 10
3
20 3
60 2
65 2
6
40 4100
25 7500
10 18000
90 7000
25 15000
25 22000
5
15 40
35 20
50 45
70 30
80 10
2
60 4
75 1
3
60 6000
75 6000
85 6000
输出样例
0.667
21.429
36.667
11.111
40.000
50.000
30.000
13.333
13.333

该题目是Virtual Judge题目,来自 北京大学POJ

题目来源 Japan 2004 Domestic

源链接: POJ-1982

最后修改于 2020-10-29T06:19:38+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 30000