Submission #68763598

---

Source Code Expand

import sys
sys.setrecursionlimit(10 ** 6)

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):

    N, Q, = map(int, src.readline().split())
    A = list(map(int, src.readline().split()))
    B = list(map(int, src.readline().split()))
    C = []
    X0 = []
    V = []
    for _q in range(Q):
        c , xs , vs = src.readline().split()
        C.append(c)
        X0.append(int(xs) - 1 )
        V.append(int(vs))
    ans = solve(N, Q, A, B, C, X0, V)
    print(*ans,  sep="\n" , file=dst)

sample = """\
4 3
3 1 4 1
2 7 1 8
A 2 3
B 3 3
A 1 7
"""

# #<nonumba> @jit(nopython=True, cache=True)
def solve(N, Q, A, B, C, X0, V):
    M = []
    for ainit , binit in zip(A, B):
        M.append(min(ainit, binit))
    prevsum = sum(M)

    anss = []
    seqs = [A, B,]
    for q in range(Q):
        prevmin = M[X0[q]]
        if C[q] == "A":
            tgt = 0
        else:
            tgt = 1
        seqs[tgt][X0[q]] = V[q]
        M[X0[q]] = min(seqs[0][X0[q]] , seqs[1][X0[q]])
        newmin = M[X0[q]]
        delta = newmin - prevmin
        prevsum += delta
        anss.append(prevsum)
    return anss




main()

Submission Info

Judge Result