Problem:


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.



Sample input:
3 10
10 10
20 5
4 3


Sample output:
10.0000000
15.0000000
13.2000000

Submission status: Wrong Answer

Solution code:
# F
import numpy as np
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que.pop()
            if t_ <= t:
                que.append([t_, v_])
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = v*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Wrong Answer

Solution code:
from collections import deque
import numpy as np

N,L = list(map(int,input().split()))
L = np.float32(L)

########################################

res = ""

t1,v1 = map(np.float32,input().split())

d = deque( [(t1,v1)] )
netsuryou = t1*v1

res += str(t1) + "\n"

for t,v in [ map(np.float32,input().split()) for _ in range(N-1) ]:
	
	netsuryou += t*v

	#右端からvリットル減らす
	l = v
	while(l > 0):
		migihasi_t,migihasi_v = d.pop()
		if migihasi_v > l:
			netsuryou -= migihasi_t*l
			d.append( ( migihasi_t,migihasi_v-l ) )
			break
		else:
			l = l - migihasi_v
			netsuryou -= migihasi_t*migihasi_v

	#答えを表示
	res += str(netsuryou / L) + "\n"

	#左のほうが温度が低ければ2つを合成
	new_t,new_v = t,v
	while(True):

		if len(d) == 0:
			d.appendleft( (new_t,new_v) )
			break

		hidarihasi_t,hidarihasi_v = d.popleft()

		#条件を満たすならループを抜ける
		if new_t >= hidarihasi_t:
			d.appendleft( (hidarihasi_t,hidarihasi_v) )
			d.appendleft( (new_t,new_v) )
			break

		new_v = new_v + hidarihasi_v
		new_t = (new_t*new_v + hidarihasi_t*hidarihasi_v) / new_v

print (res)

Submission status: Wrong Answer

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(float,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += "{0:.7f}".format(ene) + "\n"

print(res)

Submission status: Wrong Answer

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(float,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += "{0:.6f}".format(ene) + "\n"

print(res)

Submission status: Wrong Answer

Solution code:
N, L = list(map(int,input().split()))
t, v = map(int,input().split())
print(t)
res = ""

for i in range(N-1):
	t, v = map(int,input().split())
	res += str(t)+"\n"

print(res)

Submission status: Wrong Answer

Solution code:
N, L = list(map(int,input().split()))
t, v = map(int,input().split())
print(t)


for i in range(N-1):
	t, v = map(int,input().split())

Submission status: Wrong Answer

Solution code:
N, L = list(map(int,input().split()))
t, v = map(int,input().split())
print(t)


for i in range(N-1):
	t, v = map(int,input().split())
	print(v)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import array, bisect, collections, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
 
 
def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}
 
 
def solve(N, L, waters):
    now_v = 0
    now_t = 0
    ans = []
    for water in waters:
        if water[0] > now_t:
            now_v = water[1]
            now_t = water[0]
            ans.append(now_t)
        elif water[0] == now_t:
            if now_v + water[1] >= L:
                now_v = L
                ans.append(now_t)
            else:
                now_v += water[1]
                ans.append(now_t)
        elif water[0] < now_t:
            if now_v + water[1] >= L:
                now_v = L
                now_t = (now_t * (L - water[1]) + (water[0] * water[1])) / L
                ans.append(now_t)
            else:
                now_t = (now_t * now_v + water[0] * water[1]) / L                
                now_v += water[1]
                ans.append(now_t)
    
    return ans

 
def main():
    N, L = ILI()
    waters = IAI(N)
    ans = solve(N, L, waters)
    for i in ans:
        print(i)
 
 
if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
# なんだか釈然としていないが解説の通りに
from collections import deque
import sys

def MI(): return map(int, sys.stdin.readline().split())

class water:
    def __init__(self, t, v):
        self.v = v
        self.tv = v * t

    def __le__(self, other):
        return self.v * other.tv - self.tv * other.v >= 0

    def __isub__(self, other):
        t = self.tv / self.v
        self.v -= other
        self.tv = t * self.v
        return self

    def __iadd__(self, other):
        self.v+=other.v
        self.tv+=other.tv
        return self

def main():
    n, l = MI()
    dam = deque()
    t, v = MI()
    print(t)
    dam.append(water(t, v))
    # stvはtvの合計（vがlのときのvt）
    stv = t * v
    for _ in range(n-1):
        t, v = MI()
        # 朝に水をもらう
        dam.appendleft(water(t, v))
        over = v
        stv += t * v
        # 増えた分の水を古い方から捨てる
        # ベクトルごと削除できるもの
        while dam[-1].v <= over:
            w = dam.pop()
            over -= w.v
            stv -= w.tv
        # 最後のはみ出しているベクトルは縮める
        stv -= dam[-1].tv  # 一度合計から取り出して
        dam[-1] -= over  # 縮めて
        stv += dam[-1].tv  # 元に戻す
        # その日の水温を出力
        print(stv / l)
        # グラフの左側が凹んでいたらベクトルを合成して凸に直す
        while len(dam)>1 and dam[0] <= dam[1]:
            w = dam.popleft()
            dam[0] += w

main()

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

N, L = map( int, input().split() )
T = []
V = []
for i in range( N ):
  t, v = map( int, input().split() )
  T.append( t )
  V.append( v )

dq = deque()
ct, cv = 0.0, 0.0
for i in range( N ):
  while cv + V[ i ] > L:
    ft, fv = dq[ 0 ]
    take = min( cv + V[ i ] - L, fv )
    ct, cv = ( ct * cv - ft * take ) / ( cv - take ), cv - take
    if take == fv:
      dq.popleft()
    else:
      dq[ 0 ] = [ ft, fv - take ]
  ct, cv = ( ct * cv + T[ i ] * V[ i ] ) / L, L
  print( "%.7f" % ct )
  while len( dq ):
    bt, bv = dq[ len( dq ) - 1 ]
    if bt < T[ i ]: break
    T[ i ], V[ i ] = ( T[ i ] * V[ i ] + bt * bv ) / ( V[ i ] + bv ), V[ i ] + bv
    dq.pop()
  dq.append( [ T[ i ], V[ i ] ] )

Submission status: Time Limit Exceeded

Solution code:
# F
from collections import deque

TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que[-1]
            if t_ <= t:
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = t*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
                que.pop()
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
# F
import numpy as np
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que[-1]
            if t_ <= t:
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = t*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
                que.pop()
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
# F
import numpy as np
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que.pop()
            if t_ <= t:
                que.append([t_, v_])
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = t*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
# F
import numpy as np
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que.pop()
            if t_ <= t:
                que.append([t_, v_])
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que.append([t_, v_])
                que.append([t, v])
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
# F
import numpy as np
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que.pop()
            if t_ <= t:
                que.append([t_, v_])
                que.append([t, v])
                break
            elif v + v_ > L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = t*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
                if v == L:
                    que = deque([[t, v]])
                    v_now = L
                    vt_now = t*L
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
# F
import numpy as np
from collections import deque

TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que.pop()
            if t_ <= t:
                que.append([t_, v_])
                que.append([t, v])
                break
            elif v + v_ > L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
    VV = 0
    TT = 0
    for i in range(len(que)-1, -1, -1):
        t, v = que[i]
        if VV + v >= L:
            TT = ((L - VV) * t + VV * TT) / L
            VV = L
            break
        else:
            TT = (t*v + TT*VV) / (v + VV)
            VV += v
            
            
    TT_list.append(TT)

for i in range(N):
    print(TT_list[i])

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
import numpy as np

N,L = list(map(int,input().split()))
L = np.float32(L)

########################################

res = ""

t1,v1 = map(np.float64,input().split())

d = deque( [(t1,v1)] )
netsuryou = t1*v1

res += str(t1) + "\n"

for t,v in [ map(np.float64,input().split()) for _ in range(N-1) ]:
	
	netsuryou += t*v

	#右端からvリットル減らす
	l = v
	while(l > 0):
		migihasi_t,migihasi_v = d.pop()
		if migihasi_v > l:
			netsuryou -= migihasi_t*l
			d.append( ( migihasi_t,migihasi_v-l ) )
			break
		else:
			l = l - migihasi_v
			netsuryou -= migihasi_t*migihasi_v

	#答えを表示
	res += str(netsuryou / L) + "\n"

	#左のほうが温度が低ければ2つを合成
	new_t,new_v = t,v
	while(True):

		if len(d) == 0:
			d.appendleft( (new_t,new_v) )
			break

		hidarihasi_t,hidarihasi_v = d.popleft()

		#条件を満たすならループを抜ける
		if new_t >= hidarihasi_t:
			d.appendleft( (hidarihasi_t,hidarihasi_v) )
			d.appendleft( (new_t,new_v) )
			break

		new_v = new_v + hidarihasi_v
		new_t = (new_t*new_v + hidarihasi_t*hidarihasi_v) / new_v

print (res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(float,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += "{0:.6f}".format(ene/L) + "\n"

if N < 100:
	print(res)
else:
	print(100)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(float,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += "{0:.6f}".format(ene/L) + "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(int,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += "{0:.7f}".format(ene/L) + "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(float,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += str(ene/L) + "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N, L = map(int,input().split())
q = deque()
t, v = map(int,input().split())
q.append((t,v))
res = ""
res += str(t) + "\n"
ene = t*v

for que in [map(int,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	res += str(ene/L) + "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

N,L = list(map(int,input().split()))

List = []
########################################

res = ""

t1,v1 = map(int,input().split())

d = deque( [(t1,v1)] )
netsuryou = t1*v1

res += str(t1) + "\n"

for t,v in [ map(int,input().split()) for _ in range(N-1) ]:
	
	netsuryou += t*v

	#右端からvリットル減らす
	l = v
	while(l > 0):
		migihasi_t,migihasi_v = d.pop()
		if migihasi_v > l:
			netsuryou -= migihasi_t*l
			d.append( ( migihasi_t,migihasi_v-l ) )
			break
		else:
			l = l - migihasi_v
			netsuryou -= migihasi_t*migihasi_v

	#答えを表示
	res += str(netsuryou / L) + "\n"

	#左のほうが温度が低ければ2つを合成
	new_t,new_v = t,v
	while(True):

		if len(d) == 0:
			d.appendleft( (new_t,new_v) )
			break

		hidarihasi_t,hidarihasi_v = d.popleft()

		#条件を満たすならループを抜ける
		if new_t >= hidarihasi_t:
			d.appendleft( (hidarihasi_t,hidarihasi_v) )
			d.appendleft( (new_t,new_v) )
			break

		new_v = new_v + hidarihasi_v
		new_t = (new_t*new_v + hidarihasi_t*hidarihasi_v) / new_v

print (res)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

N,L = list(map(int,input().split()))

List = []
########################################


t1,v1 = map(int,input().split())

d = deque( [(t1,v1)] )
netsuryou = t1*v1

print (t1)

for t,v in [ map(int,input().split()) for _ in range(N-1) ]:
	
	netsuryou += t*v

	#右端からvリットル減らす
	l = v
	while(l > 0):
		migihasi_t,migihasi_v = d.pop()
		if migihasi_v > l:
			netsuryou -= migihasi_t*l
			d.append( ( migihasi_t,migihasi_v-l ) )
			break
		else:
			l = l - migihasi_v
			netsuryou -= migihasi_t*migihasi_v

	#答えを表示
	print (netsuryou / L)

	#左のほうが温度が低ければ2つを合成
	new_t,new_v = t,v
	while(True):

		if len(d) == 0:
			d.appendleft( (new_t,new_v) )
			break

		hidarihasi_t,hidarihasi_v = d.popleft()

		#条件を満たすならループを抜ける
		if new_t >= hidarihasi_t:
			d.appendleft( (hidarihasi_t,hidarihasi_v) )
			d.appendleft( (new_t,new_v) )
			break

		new_v = new_v + hidarihasi_v
		new_t = (new_t*new_v + hidarihasi_t*hidarihasi_v) / new_v

Submission status: Time Limit Exceeded

Solution code:
from collections import deque

N, L = map(int,input().split())

q = deque()
t, v = map(int,input().split())
q.append((t,v))
print(t)
ene = t*v

for que in [map(int,input().split()) for _ in range(N-1)]:
	t, v = que
	rest = v
	ene += t*v
	while rest > 0:
		t_, v_ = q.pop()
		if v_ > rest:
			q.append((t_, v_-rest))
			ene -= rest*t_
			break
		else:
			rest -= v_
			ene -= v_*t_
	while len(q) and t < q[0][0]:
		t_, v_ = q.popleft()
		t = (t*v+t_*v_)/(v+v_)
		v = v+v_
	q.appendleft((t,v))
	
	print(ene/L)

Submission status: Time Limit Exceeded

Solution code:
N, L = list(map(int,input().split()))
res = ""
t, v = map(int,input().split())
print(t)
temp = float(t*v)
mintemp = temp/v

for i in range(N-1):
	t, v = map(int,input().split())
	sute = 0
	temp += t*v
	temp -= mintemp*v
	mintemp = min(mintemp, temp/L)
	print(temp/L)

Submission status: Time Limit Exceeded

Solution code:
N, L = list(map(int,input().split()))
res = ""
t, v = list(map(int,input().split()))
res += str(t)
temp = float(t*v)
res += "\n"
mintemp = temp/v

for i in range(N-1):
	t, v = list(map(int,input().split()))
	sute = 0
	temp += t*v
	temp -= mintemp*v
	mintemp = min(mintemp, temp/L)
	res += str(temp/L)
	res += "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from queue import PriorityQueue

q = PriorityQueue()

N, L = list(map(int,input().split()))
res = ""
t, v = list(map(int,input().split()))
res += str(t)
temp = float(t*v)
res += "\n"
mintemp = temp/v

for i in range(N-1):
	t, v = list(map(int,input().split()))
	sute = 0
	temp += t*v
	temp -= mintemp*v
	mintemp = min(mintemp, temp/L)
	res += str(temp/L)
	res += "\n"

print(res)

Submission status: Time Limit Exceeded

Solution code:
from queue import PriorityQueue

q = PriorityQueue()

N, L = list(map(int,input().split()))
res = ""
t, v = list(map(int,input().split()))
res += str(t)
temp = float(t*v)
res += "\n"
q.put([t,v])

for i in range(N-1):
	t, v = list(map(int,input().split()))
	sute = 0
	temp += (t*v)
	while sute < v:
		s = q.get()
		if s[1] > v-sute:
			temp -= s[0]*(v-sute)
			s[1] -= v-sute
			sute = v
			q.put(s)
		else:
			temp -= s[0]*s[1]
			sute += s[1]
	q.put([temp/L,L])
	res += str(temp/L)
	res += "\n"

print(res)

Submission status: Memory Limit Exceeded

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# 各日に対して、関数：残量 -> 最適な熱量 を持つことを考える
# これは折れ線。傾きが増加する部分 → マージしてまとめる
# 常に、傾きの減少列の形で持つことになる

from collections import deque

N,L = map(int,readline().split())
m = map(int,read().split())
TV = zip(m,m)

answer = []
INF = 10 ** 18

# 1日目
t,v = next(TV)
answer.append(t)
qT = deque([t])
qV = deque([v])
sum_q = t * v # 今持っている総熱量

for t,v in TV:
    qT.appendleft(t); qV.appendleft(v)
    sum_q += t * v
    # 右側からvだけ捨てる
    rest = v
    while qV[-1] <= rest:
        x = qV.pop()
        rest -= x
        sum_q -= x * qT.pop()
    qV[-1] -= rest
    sum_q -= rest * qT[-1]
    # 左側から傾きの増大部分をマージ
    while len(qT) >= 2:
        t0 = qT[0]; t1 = qT[1]
        if t0 > t1:
            break
        qT.popleft()
        v0 = qV.popleft(); v1 = qV[0]
        t2 = (t0 * v0 + t1 * v1) / (v0 + v1)
        qT[0] = t2; qV[0] += v0
    answer.append(sum_q/L)

print('\n'.join(map(str,answer)))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

# 各日に対して、関数：残量 -> 最適な熱量 を持つことを考える
# これは折れ線。傾きが増加する部分 → マージしてまとめる
# 常に、傾きの減少列の形で持つことになる

from collections import deque

N,L = map(int,readline().split())
m = map(int,read().split())
TV = zip(m,m)

answer = []
INF = 10 ** 18

# 1日目
t,v = next(TV)
print(t)
qT = deque([t])
qV = deque([v])
sum_q = t * v # 今持っている総熱量

for t,v in TV:
    qT.appendleft(t); qV.appendleft(v)
    sum_q += t * v
    # 右側からvだけ捨てる
    rest = v
    while qV[-1] <= rest:
        x = qV.pop()
        rest -= x
        sum_q -= x * qT.pop()
    qV[-1] -= rest
    sum_q -= rest * qT[-1]
    # 左側から傾きの増大部分をマージ
    while len(qT) >= 2:
        t0 = qT[0]; t1 = qT[1]
        if t0 > t1:
            break
        qT.popleft()
        v0 = qV.popleft(); v1 = qV[0]
        t2 = (t0 * v0 + t1 * v1) / (v0 + v1)
        qT[0] = t2; qV[0] += v0
    print(sum_q/L)

Submission status: Accepted

Solution code:
# F
from collections import deque
 
TT_list = []
# input
N, L = map(int, input().split())
T = 0.0
vt_now = 0.0
v_now = 0
que = deque()

for i in range(N):
    ti, v = map(int, input().split())
    t = float(ti)
    v_now += v
    vt_now += v*t
    # add
    if v == L:
        que.append([t, v])
    else:
        while v < L and len(que) > 0:
            t_, v_ = que[-1]
            if t_ <= t:
                que.append([t, v])
                break
            elif v + v_ >= L:
                v_ = v + v_ - L
                t = ((L - v) * t_ + v * t) / L
                v = L
                que = deque([[t, v]])
                v_now = L
                vt_now = t*L
                # break
            else:
                t = (t*v + t_*v_) / (v + v_)
                v = v + v_
                que.pop()
    # minus
    while v_now > L:
        if que[0][1] <= v_now - L:
            v_now -= que[0][1]
            vt_now -= que[0][1]*que[0][0]
            que.popleft()
        else:
            que[0][1] -= v_now - L
            vt_now -= (v_now - L)*que[0][0]
            v_now = L
            
    TT_list.append(vt_now / L)

for i in range(N):
    print(TT_list[i])

Submission status: Accepted

Solution code:
from collections import deque

N, L = map( int, input().split() )
T = []
V = []
for i in range( N ):
  t, v = map( int, input().split() )
  T.append( t )
  V.append( v )

dq = deque()
ct, cv = 0.0, 0.0
for i in range( N ):
  while cv + V[ i ] > L:
    ft, fv = dq[ 0 ]
    take = min( cv + V[ i ] - L, fv )
    ct, cv = ( ct * cv - ft * take ) / ( cv - take ), cv - take
    if take == fv:
      dq.popleft()
    else:
      dq[ 0 ] = [ ft, fv - take ]
  ct, cv = ( ct * cv + T[ i ] * V[ i ] ) / L, L
  print( "%.7f" % ct )
  while len( dq ):
    bt, bv = dq[ len( dq ) - 1 ]
    if bt < T[ i ]: break
    T[ i ], V[ i ] = ( T[ i ] * V[ i ] + bt * bv ) / ( V[ i ] + bv ), V[ i ] + bv
    dq.pop()
  dq.append( [ T[ i ], V[ i ] ] )