Submission #68745629

---

Source Code Expand

import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10**7)
def INT(): return int(input())
def MI(d=0): return map(lambda x:int(x)+d, input().split())
def MS(): return map(str, input().split())
def LI(d=0): return list(map(lambda x:int(x)+d, input().split()))
def LS(): return list(map(str, input().split()))
def pr_line(itr): print(*itr, sep='\n')
def pr_mtx(matrix): [print(*row) for row in matrix] 
dij = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dij2 = [[1, 0], [0, 1], [-1, 0], [0, -1], [1, 1], [1, -1], [-1, 1], [-1, -1]]
INF = float('inf')

N, Q = MI()
A = LI()
B = LI()

sigma = 0
for i in range(N):
    sigma += min(A[i], B[i])

ans = []
for _ in range(Q):
    c, X, V = MS()
    X = int(X) - 1
    V = int(V)

    p_mn = min(A[X], B[X])
    if c == 'A':
        A[X] = V
    else:
        B[X] = V
    n_mn = min(A[X], B[X])

    diff = n_mn - p_mn
    sigma += diff
    ans.append(sigma)

pr_line(ans)

Submission Info

Judge Result