結果
問題 | No.865 24時間降水量 |
ユーザー | nadare |
提出日時 | 2019-08-16 22:51:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,689 ms / 2,000 ms |
コード長 | 2,241 bytes |
コンパイル時間 | 1,581 ms |
コンパイル使用メモリ | 81,512 KB |
実行使用メモリ | 118,140 KB |
最終ジャッジ日時 | 2023-10-24 02:33:29 |
合計ジャッジ時間 | 9,098 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
53,532 KB |
testcase_01 | AC | 42 ms
53,532 KB |
testcase_02 | AC | 41 ms
53,532 KB |
testcase_03 | AC | 43 ms
53,532 KB |
testcase_04 | AC | 44 ms
53,532 KB |
testcase_05 | AC | 122 ms
76,064 KB |
testcase_06 | AC | 133 ms
76,400 KB |
testcase_07 | AC | 172 ms
77,112 KB |
testcase_08 | AC | 111 ms
76,108 KB |
testcase_09 | AC | 107 ms
76,100 KB |
testcase_10 | AC | 172 ms
76,868 KB |
testcase_11 | AC | 219 ms
77,328 KB |
testcase_12 | AC | 169 ms
76,888 KB |
testcase_13 | AC | 191 ms
77,036 KB |
testcase_14 | AC | 168 ms
76,940 KB |
testcase_15 | AC | 1,644 ms
118,140 KB |
testcase_16 | AC | 1,689 ms
118,140 KB |
testcase_17 | AC | 1,679 ms
117,876 KB |
testcase_18 | AC | 40 ms
53,540 KB |
testcase_19 | AC | 40 ms
53,540 KB |
testcase_20 | AC | 42 ms
53,540 KB |
ソースコード
from math import sqrt import sys input = sys.stdin.readline 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])