200723: [AtCoder]ARC072 F - Dam

Memory Limit:256 MB Time Limit:3 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $900$ points

Problem Statement

You are in charge of controlling a dam. The dam can store at most $L$ liters of water. Initially, the dam is empty. Some amount of water flows into the dam every morning, and any amount of water may be discharged every night, but this amount needs to be set so that no water overflows the dam the next morning.

It is known that $v_i$ liters of water at $t_i$ degrees Celsius will flow into the dam on the morning of the $i$-th day. You are wondering about the maximum possible temperature of water in the dam at noon of each day, under the condition that there needs to be exactly $L$ liters of water in the dam at that time. For each $i$, find the maximum possible temperature of water in the dam at noon of the $i$-th day. Here, consider each maximization separately, that is, the amount of water discharged for the maximization of the temperature on the $i$-th day, may be different from the amount of water discharged for the maximization of the temperature on the $j$-th day $(j≠i)$.

Also, assume that the temperature of water is not affected by anything but new water that flows into the dam. That is, when $V_1$ liters of water at $T_1$ degrees Celsius and $V_2$ liters of water at $T_2$ degrees Celsius are mixed together, they will become $V_1+V_2$ liters of water at $\frac{T_1*V_1+T_2*V_2}{V_1+V_2}$ degrees Celsius, and the volume and temperature of water are not affected by any other factors.

Constraints

  • $1≤ N ≤ 5*10^5$
  • $1≤ L ≤ 10^9$
  • $0≤ t_i ≤ 10^9(1≤i≤N)$
  • $1≤ v_i ≤ L(1≤i≤N)$
  • $v_1 = L$
  • $L$, each $t_i$ and $v_i$ are integers.

Input

Input is given from Standard Input in the following format:

$N$ $L$
$t_1$ $v_1$
$t_2$ $v_2$
$:$
$t_N$ $v_N$

Output

Print $N$ lines. The $i$-th line should contain the maximum temperature such that it is possible to store $L$ liters of water at that temperature in the dam at noon of the $i$-th day.

Each of these values is accepted if the absolute or relative error is at most $10^{-6}$.


Sample Input 1

3 10
10 10
20 5
4 3

Sample Output 1

10.0000000
15.0000000
13.2000000
  • On the first day, the temperature of water in the dam is always $10$ degrees: the temperature of the only water that flows into the dam on the first day.

  • $10$ liters of water at $15$ degrees of Celsius can be stored on the second day, by discharging $5$ liters of water on the night of the first day, and mix the remaining water with the water that flows into the dam on the second day.

  • $10$ liters of water at $13.2$ degrees of Celsius can be stored on the third day, by discharging $8$ liters of water on the night of the first day, and mix the remaining water with the water that flows into the dam on the second and third days.


Sample Input 2

4 15
0 15
2 5
3 6
4 4

Sample Output 2

0.0000000
0.6666667
1.8666667
2.9333333

Sample Input 3

4 15
1000000000 15
9 5
8 6
7 4

Sample Output 3

1000000000.0000000
666666669.6666666
400000005.0000000
293333338.8666667

Although the temperature of water may exceed $100$ degrees Celsius, we assume that water does not vaporize.

Input

题意翻译

有个水库,最多能存$L$单位水,一开始是空的 接下来$n$天,每天早上有$v_i$单位的,水温为$t_i$的水流进来 每天晚上你可以放掉一些水,多少自定。但是必须保证第二天水库不会溢出 现在问,对于每个$i$,在使用最优放水策略的情况下,第$i$天水库是满的情况下最高水温 (每一问之间互相独立) 混合后的温度计算:$t_3=\frac{t_1*v_1+t_2*v_2}{v_1+v_2}$ $0 \leq n \leq 5 * 10^5$,其他数int范围内

加入题单

上一题 下一题 算法标签: