提出 #32057668

---

ソースコード 拡げる

import math
import bisect

ST = [[] for i in range(800005)]
pre = [[] for i in range(800005)]
val = [0 for i in range(200005)]
lst = [0 for i in range(200005)]

def update(id, l, r, tl, tr, val, time):
    if l > tr or r < tl:
        return
    if l >= tl and r <= tr:
        # print("ADD ", l, r)
        ST[id].append(time)
        if len(pre[id]) > 0:
            pre[id].append(pre[id][-1] + val)
        else:
            pre[id].append(val)
        return
    
    m = (l + r) // 2
    update(id * 2, l, m, tl, tr, val, time)
    update(id * 2 + 1, m + 1, r, tl, tr, val, time)

def query(id, l, r, x, time):
    
    res = 0
    if len(pre[id]) == 0 or ST[id][-1] <= time:
        res = 0
    elif (ST[id][0] >= time):
        res = pre[id][-1]
    else:
        res = pre[id][-1] - pre[id][bisect.bisect_left(ST[id], time, lo=0, hi=len(ST[id])) - 1]
    
    if l == r:
        return res
        
    m = (l + r) // 2
    if x <= m:
        return res + query(id * 2, l, m, x, time)
    else:
        return res + query(id * 2 + 1, m + 1, r, x, time)
    
inp = [int(x) for x in input().split()]
n, m, q = inp[0], inp[1], inp[2]

for time in range(1, q + 1):
    a = [int(x) for x in input().split()]
    if a[0] == 1:
        update(1, 1, m, a[1], a[2], a[3], time)
    elif a[0] == 2:
        val[a[1]] = a[2]
        lst[a[1]] = time
    else:
        print(val[a[1]] + query(1, 1, m, a[2], lst[a[1]]))

提出情報

ジャッジ結果