結果

問題 No.865 24時間降水量
ユーザー nadarenadare
提出日時 2019-08-16 22:47:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,727 ms / 2,000 ms
コード長 2,227 bytes
コンパイル時間 353 ms
コンパイル使用メモリ 82,164 KB
実行使用メモリ 119,080 KB
最終ジャッジ日時 2024-09-22 19:18:32
合計ジャッジ時間 8,484 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 18
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# -*- coding: utf-8 -*-
from math import sqrt
def inpl(): return list(map(int, input().split()))
class SegmentTree:
def __init__(self, N, init_node=None):
self.size = 2**int.bit_length(N)
self.node = [0]*(2*self.size-1)
if not init_node is None:
for i in range(N):
self.node[i+self.size-1] = init_node[i]
for i in range(self.size-2, -1, -1):
self.node[i] = max(self.node[2*i+1], self.node[2*i+2])
def add(self, x, val):
x += self.size - 1
self.node[x] += val
while x:
x = (x-1)//2
self.node[x] = max(self.node[2*x+1], self.node[2*x+2])
class LazySegmentTree:
def __init__(self, N, init_node=None):
self.size = 2**int.bit_length(N)
self.node = [0]*(2*self.size-1)
if not init_node is None:
for i in range(N):
self.node[i+self.size-1] = init_node[i]
for i in range(self.size-2, -1, -1):
self.node[i] = max(self.node[2*i+1], self.node[2*i+2])
self.lazy = [0]*(2*self.size-1)
def eval(self, k, l, r):
if self.lazy[k]:
self.node[k] += self.lazy[k]
if r-l-1:
self.lazy[2*k+1] += self.lazy[k]
self.lazy[2*k+2] += self.lazy[k]
self.lazy[k] = 0
def add(self, a, b, val, k=None, l=None, r=None):
if k is None:
k = 0
l = 0
r = self.size
self.eval(k, l, r)
if (b <= l) or (r <= a):
return
if (a<=l) and (r<=b):
self.lazy[k] += val
self.eval(k, l, r)
else:
self.add(a, b, val, 2*k+1, l, (l+r)//2)
self.add(a, b, val, 2*k+2, (l+r)//2, r)
self.node[k] = max(self.node[2*k+1], self.node[2*k+2])
N = int(input())
A = [0] * 23 + inpl() + [0]*23
s = sum(A[:24])
X = [0]*(N + 46)
for i in range(24):
X[i] = A[23]*1
s = A[23]*1
for i in range(24, N+46):
s += A[i] - A[i-24]
X[i] = s
seg = LazySegmentTree(len(X), X)
for _ in range(int(input())):
t, v = inpl()
t += 22
d = v - A[t]
A[t] = v
seg.add(t, t+24, d)
print(seg.node[0])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0