結果

問題 No.865 24時間降水量
ユーザー brthyyjpbrthyyjp
提出日時 2021-11-28 12:39:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,032 ms / 2,000 ms
コード長 3,200 bytes
コンパイル時間 410 ms
コンパイル使用メモリ 87,212 KB
実行使用メモリ 124,792 KB
最終ジャッジ日時 2023-09-13 21:13:19
合計ジャッジ時間 7,182 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
71,396 KB
testcase_01 AC 75 ms
71,448 KB
testcase_02 AC 74 ms
71,384 KB
testcase_03 AC 72 ms
71,400 KB
testcase_04 AC 75 ms
71,328 KB
testcase_05 AC 138 ms
77,328 KB
testcase_06 AC 135 ms
77,620 KB
testcase_07 AC 139 ms
77,536 KB
testcase_08 AC 134 ms
77,624 KB
testcase_09 AC 136 ms
77,268 KB
testcase_10 AC 219 ms
79,372 KB
testcase_11 AC 222 ms
80,164 KB
testcase_12 AC 208 ms
79,340 KB
testcase_13 AC 202 ms
79,672 KB
testcase_14 AC 206 ms
79,892 KB
testcase_15 AC 1,032 ms
124,492 KB
testcase_16 AC 1,005 ms
124,540 KB
testcase_17 AC 971 ms
124,792 KB
testcase_18 AC 70 ms
71,456 KB
testcase_19 AC 71 ms
71,396 KB
testcase_20 AC 71 ms
71,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class LazySegTree:
    # RMQ and RAQ
    def __init__(self, init_val, seg_ide, lazy_ide, segfunc):
        self.n = len(init_val)
        self.num = 2**(self.n-1).bit_length()

        self.seg_ide = seg_ide
        self.lazy_ide = lazy_ide

        self.segfunc = segfunc

        # seg, lazy: 1-indexed
        self.seg = [seg_ide]*2*self.num
        for i in range(self.n):
            self.seg[i+self.num] = init_val[i]
        for i in range(self.num-1, 0, -1):
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

        self.lazy = [lazy_ide]*2*self.num

    def gindex(self, l, r):
        # l, r: 1-indexed
        L = l + self.num
        R = r + self.num
        lm = (L // (L & -L)) >> 1
        rm = (R // (R & -R)) >> 1
        while L < R:
            if R <= rm:
                yield R
            if L <= lm:
                yield L
            L = L >> 1
            R = R >> 1
        while L:
            yield L
            L = L >> 1

    def propagate(self, *ids):
        # ids: 1-indexed
        for i in reversed(ids):
            v = self.lazy[i]
            if v == self.lazy_ide:
                continue
            self.lazy[2*i] += v
            self.lazy[2*i+1] += v
            self.seg[2*i] += v
            self.seg[2*i+1] += v
            self.lazy[i] = self.lazy_ide

    def update(self, l, r, x):
        # l, r: 0-indexed
        # add x to [l, r)
        L = l + self.num
        R = r + self.num
        while L < R:
            if R & 1:
                R -= 1
                self.lazy[R] += x
                self.seg[R] += x
            if L & 1:
                self.lazy[L] += x
                self.seg[L] += x
                L += 1
            L = L >> 1
            R = R >> 1
        for i in self.gindex(l, r):
            # i: 1-indexed
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1]) + self.lazy[i]

    def query(self, l, r):
        # l, r: 0-indexed
        # query for [l, r)
        if r <= l:
            return self.seg_ide

        self.propagate(*self.gindex(l, r))
        L = l + self.num
        R = r + self.num
        res = self.seg_ide
        while L < R:
            if R & 1:
                R -= 1
                res = self.segfunc(res, self.seg[R])
            if L & 1:
                res = self.segfunc(self.seg[L], res)
                L += 1
            L = L >> 1
            R = R >> 1
        return res

    def __str__(self): # for debug
        arr = [self.query(i,i+1) for i in range(self.n)]
        return str(arr)

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

from itertools import accumulate

def main():

    n = int(input())
    A = list(map(int, input().split()))

    C = [0]+A
    C = list(accumulate(C))
    B = []
    for i in range(n):
        if i+24 <= n:
            b = C[i+24]-C[i]
            B.append(b)
    seg = LazySegTree(B, -1, 0, max)
    q = int(input())
    for i in range(q):
        t, v = map(int, input().split())
        t -= 1
        p = A[t]
        seg.update(max(0, t-23), min(seg.n, t+1), -p+v)
        A[t] = v
        print(seg.query(0, seg.n))

if __name__ == '__main__':
    main()
0