Problem:
 (Please read problem A first. The maximum score you can get by solving this problem C is 1, which will have almost no effect on your ranking.)    Beginner's Guide "Local search" is a powerful method for finding a high-quality solution.
In this method, instead of constructing a solution from scratch, we try to find a better solution by slightly modifying the already found solution.
If the solution gets better, update it, and if it gets worse, restore it.
By repeating this process, the quality of the solution is gradually improved over time.
The pseudo-code is as follows.  solution = compute an initial solution (by random generation, or by applying other methods such as greedy)
while the remaining time > 0:
    slightly modify the solution (randomly)
    if the solution gets worse:
        restore the solution  For example, in this problem, we can use the following modification: pick the date d and contest type q at random and change the type of contest to be held on day d to q .
The pseudo-code is as follows.  t[1..D] = compute an initial solution (by random generation, or by applying other methods such as greedy)
while the remaining time > 0:
    pick d and q at random
    old = t[d] # Remember the original value so that we can restore it later
    t[d] = q
    if the solution gets worse:
        t[d] = old  The most important thing when using the local search method is the design of how to modify solutions.   If the amount of modification is too small, we will soon fall into a dead-end (local optimum) and, conversely, if the amount of modification is too large, the probability of finding an improving move becomes extremely small.  In order to increase the number of iterations, it is desirable to be able to quickly calculate the score after applying a modification.   In this problem C, we focus on the second point.
The score after the modification can, of course, be obtained by calculating the score from scratch.
However, by focusing on only the parts that have been modified, it may be possible to quickly compute the difference between the scores before and after the modification.
From another viewpoint, the impossibility of such a fast incremental calculation implies that a small modification to the solution affects a majority of the score calculation.
In such a case, we may need to redesign how to modify solutions, or there is a high possibility that the problem is not suitable for local search.
Let's implement fast incremental score computation.
It's time to demonstrate the skills of algorithms and data structures you have developed in ABC and ARC!  In this kind of contest, where the objective is to find a better solution instead of the optimal one, a bug in a program does not result in a wrong answer, which may delay the discovery of the bug.
For early detection of bugs, it is a good idea to unit test functions you implemented complicated routines.
For example, if you implement fast incremental score calculation, it is a good idea to test that the scores computed by the fast implementation match the scores computed from scratch, as we will do in this problem C.      Problem Statement You will be given a contest schedule for D days and M queries of schedule modification.
In the i -th query, given integers d_i and q_i , change the type of contest to be held on day d_i to q_i , and then output the final satisfaction at the end of day D on the updated schedule.
Note that we do not revert each query. That is, the i -th query is applied to the new schedule obtained by the (i-1) -th query.        Input Input is given from Standard Input in the form of the input of Problem A followed by the output of Problem A and the queries.  D  c_1  c_2  \cdots  c_{26}  s_{1,1}  s_{1,2}  \cdots  s_{1,26}  \vdots  s_{D,1}  s_{D,2}  \cdots  s_{D,26}  t_1  t_2  \vdots  t_D  M  d_1  q_1  d_2  q_2  \vdots  d_M  q_M    The constraints and generation methods for the input part are the same as those for Problem A.  For each d=1,\ldots,D , t_d is an integer generated independently and uniformly at random from {1,2,\ldots,26} .  The number of queries M is an integer satisfying 1\leq M\leq 10^5 .  For each i=1,\ldots,M , d_i is an integer generated independently and uniformly at random from {1,2,\ldots,D} .  For each i=1,\ldots,26 , q_i is an integer satisfying 1\leq q_i\leq 26 generated uniformly at random from the 25 values that differ from the type of contest on day d_i .       Output Let v_i be the final satisfaction at the end of day D on the schedule after applying the i -th query.
Print M integers v_i to Standard Output in the following format:  v_1  v_2  \vdots  v_M         Sample Input 1 5
86 90 69 51 2 96 71 47 88 34 45 46 89 34 31 38 97 84 41 80 14 4 50 83 7 82
19771 12979 18912 10432 10544 12928 13403 3047 10527 9740 8100 92 2856 14730 1396 15905 6534 4650 11469 3628 8433 2994 10899 16396 18355 11424
6674 17707 13855 16407 12232 2886 11908 1705 5000 1537 10440 10711 4917 10770 17272 15364 19277 18094 3929 3705 7169 6159 18683 15410 9092 4570
6878 4239 19925 1799 375 9563 3445 5658 19857 11401 6997 6498 19933 3848 2426 2146 19745 16880 17773 18359 3921 14172 16730 11157 5439 256
8633 15862 15303 10749 18499 7792 10317 5901 9395 11433 3514 3959 5202 19850 19469 9790 5653 784 18500 10552 17975 16615 7852 197 8471 7452
19855 17918 7990 10572 4333 438 9140 9104 12622 4985 12319 4028 19922 12132 16259 17476 2976 547 19195 19830 16285 4806 4471 9457 2864 2192
1
17
13
14
13
5
1 7
4 11
3 4
5 24
4 19      Sample Output 1 72882
56634
38425
27930
42884  Note that this example is a small one for checking the problem specification. It does not satisfy the constraint D=365 and is never actually given as a test case.      Next Step Let's go back to Problem A and implement the local search algorithm by utilizing the incremental score calculator you just implemented!
For this problem, the current modification "pick the date d and contest type q at random and change the type of contest to be held on day d to q " is actually not so good. By considering why it is not good, let's improve the modification operation.
One of the most powerful and widely used variant of the local search method is "Simulated Annealing (SA)", which makes it easier to reach a better solution by stochastically accepting worsening moves.
For more information about SA and other local search techniques, please refer to the editorial that will be published after the contest.

Solution (Python):
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json

import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools

sys.setrecursionlimit(10 ** 8)

M = 10 ** 9 + 7
INF = 10 ** 17


def main():
    D = int(input())
    c = [int(a) for a in input().split()]
    s = [
        [int(a) for a in input().split()]
        for _ in range(D)
    ]
    t = [
        int(input())
        for _ in range(D)
    ]
    M = int(input())
    dq = [
        [int(a) for a in input().split()]
        for _ in range(M)
    ]

    def calc_score(t):
        score = 0
        last = [0] * len(c)
        res = []

        for d, ti in enumerate(t):
            sdi = s[d][ti - 1]
            score += sdi
            last[ti - 1] = d + 1
            for i, ci in enumerate(c):
                score -= ci * ((d + 1) - last[i])
            res.append(score)
        return res

    def calc_score_diff(t, di, qi):
        old_q = t[di - 1]
        last_old_q_date = 0
        for i in range(di - 2, -1, -1):
            if t[i] == old_q:
                last_old_q_date = i + 1
                break
        next_old_q_date = D + 1
        for i in range(di, D):
            if t[i] == old_q:
                next_old_q_date = i + 1
                break

        old_d_last = di - last_old_q_date
        old_d_next = next_old_q_date - di
        old_diff = old_d_next * old_d_last * c[old_q - 1]

        new_q = qi
        last_new_q_date = 0
        for i in range(di - 2, -1, -1):
            if t[i] == new_q:
                last_new_q_date = i + 1
                break
        next_new_q_date = D + 1
        for i in range(di, D):
            if t[i] == new_q:
                next_new_q_date = i + 1
                break

        new_d_last = di - last_new_q_date
        new_d_next = next_new_q_date - di
        new_diff = new_d_next * new_d_last * c[new_q - 1]

        old_score = s[di - 1][old_q - 1]
        new_score = s[di - 1][new_q - 1]
        return new_diff - old_diff + new_score - old_score

    score = calc_score(t)[-1]
    for di, qi in dq:
        diff = calc_score_diff(t, di, qi)
        score += diff
        print(score)
        t[di - 1] = qi


if __name__ == "__main__":
    main()

Solution (Python):
D=int(input())
c = list(map(int,input().split()))

s=[None]*D
for i in range(D):
    s[i] = list(map(int,input().split()))
t=[0]*D
for i in range(D):
    t[i]=int(input())
    
m=int(input())
d=[None]*m
q=[None]*m
for i in range(m):
    d[i],q[i] = map(int,input().split())
sumc=sum(c)



def calc_score(t):
    last=[0]*26
    satis=0
    pena=0
    delta_pena=0
    for j in range(D):
        ss=s[j]
        tt=t[j]
        satis += ss[tt-1]
        delta_pena += sumc - c[tt-1]*(j+1-last[tt-1])

        last[tt-1]=j+1   
        pena += delta_pena
    return satis-pena

for i in range(m):
    t[d[i]-1] = q[i]
    print(calc_score(t))

Solution (Python):
from bisect import bisect_left, bisect_right

class Set(): 
    def __init__(self, valuelist, INF=10**18+1):
        self.n = len(valuelist) + 1
        self.value = sorted(valuelist) + [INF]
        self.comp = {v : k for k, v in enumerate(self.value, 1)}
        self.bit = BinaryIndexedTree(self.n)

    def insert(self, x, k=1):
        self.bit.add(self.comp[x], k)

    def delete(self, x, k=1):
        self.bit.add(self.comp[x], -k)

    def count(self, x):
        return self.bit.get(self.comp[x])

    def sum(self, x):
        return self.bit.sum(self.comp[x])

    def get(self, k): 
        return self.value[self.bit.bisect_left(k) - 1]

class BinaryIndexedTree(): 
    def __init__(self, n):
        self.n = n
        self.tree = [0 for _ in range(n + 1)]

    def sum(self, idx):
        res = 0
        while idx:
            res += self.tree[idx]
            idx -= idx & -idx
        return res

    def get(self, idx):
        return self.sum(idx) - self.sum(idx - 1)

    def add(self, idx, x):
        while idx <= self.n:
            self.tree[idx] += x
            idx += idx & -idx

    def bisect_left(self, x):
        if x <= 0: return 0
        res, tmp = 0, 2**((self.n).bit_length() - 1)
        while tmp:
            if res + tmp <= self.n and self.tree[res + tmp] < x:
                x -= self.tree[res + tmp]
                res += tmp
            tmp >>= 1
        if res >= self.n:
            return self.n
        return res + 1

D = int(input())
C = list(map(int, input().split()))
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(input()) for _ in range(D)]

M = int(input())
Q = [tuple(map(int, input().split())) for _ in range(M)]

res = 0
last = [0 for _ in range(26)]
used = [Set(list(range(D))) for i in range(26)]

for d in range(D):
    res += S[d][T[d] - 1]
    last[T[d] - 1] = d + 1
    used[T[d] - 1].insert(d)
    for j in range(26):
        res -= C[j] * ((d + 1) - last[j])

for i in range(M):
    d, q = Q[i]
    if T[d - 1] == q:
        print(res)
        continue
    res -= S[d - 1][T[d - 1] - 1]
    res += S[d - 1][q - 1]
    k = used[T[d - 1] - 1].sum(d - 1)
    l = used[T[d - 1] - 1].get(k - 1) if k != 1 else -1
    r = used[T[d - 1] - 1].get(k + 1)
    if r == 1000000000000000001:
        r = D
    res -= (d - 1 - l) * C[T[d - 1] - 1] * (r - d + 1)
    used[T[d - 1] - 1].delete(d - 1)
    used[q - 1].insert(d - 1)
    k = used[q - 1].sum(d - 1)
    l = used[q - 1].get(k - 1) if k != 1 else -1
    r = used[q - 1].get(k + 1)
    if r == 1000000000000000001:
        r = D
    res += (d - 1 - l) * C[q - 1] * (r - d + 1)
    T[d - 1] = q
    print(res)

Solution (Python):

def main():
    D = int(input())
    c_list = list(map(int, input().split()))
    s_list = [list(map(int, input().split())) for _ in range(D)]
    t_list = [int(input()) for _ in range(D)]

    basic_bad = sum(c_list)
    
    M = int(input())
    for m in range(M):
        d,q = map(int, input().split())
        t_list[d-1] = q
        res = 0
        
        bad = 0
        last_open = [0] * 26
        for i in range(D):
            t = t_list[i]
            res += s_list[i][t-1]

            
            
            
            
            bad += basic_bad - (i+1 - last_open[t-1]) * c_list[t-1]
            last_open[t-1] = i+1

            res -= bad

        print(res)

if __name__ == "__main__":
    main()

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union






























def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def isp():   return input().split()
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    def calc_total_score(schedule):
        ans = []
        last = [-1] * 26
        satisfy = 0
        for day in range(D):
            contest_id = schedule[day]
            last[contest_id] = day
            satisfy += score[day][contest_id]
            for i in range(26):
                satisfy -= c[i] * (day - last[i])
            ans.append(satisfy)
        return ans
    

    def change_contest(schedule, target_day, new_contest):
        
        prev_contest = schedule[target_day]
        diff = 0
        diff += (score[target_day][new_contest] - score[target_day][prev_contest])
        i = target_day - 1
        while i >= 0:
            if schedule[i] == prev_contest:
                break
            i -= 1
        j = target_day + 1
        while j <= len(schedule) - 1:
            if schedule[j] == prev_contest:
                break
            j += 1
        diff -= (j - target_day) * (target_day - i) * c[prev_contest]
        i = target_day - 1
        while i >= 0:
            if schedule[i] == new_contest:
                break
            i -= 1
        j = target_day + 1
        while j <= len(schedule) - 1:
            if schedule[j] == new_contest:
                break
            j += 1
        diff += (j - target_day) * (target_day - i) * c[new_contest]
        schedule[target_day] = new_contest
        return diff

    

    D = ii()
    c = lmi()
    score = [lmi() for _ in range(D)]

    schedule = [ii() - 1 for _ in range(D)]
    satisfy_list = calc_total_score(schedule)
    satisfy = satisfy_list[-1]

    

    m = ii()
    query = [lmi_0() for _ in range(m)]
    for target_day, new_contest in query:
        diff = change_contest(schedule, target_day, new_contest)
        satisfy += diff
        print(satisfy)




if __name__ == "__main__":
    main()

Solution (Python):
def examA():
    N = 26
    D = I()
    C = LI()
    S = [LI()for _ in range(N)]
    ans = [0]*D

    for v in ans:
        print(v)
    return

def examB():
    N = 26
    D = I()
    C = LI()
    S = [LI()for _ in range(D)]
    T = [I()for _ in range(D)]
    ans = [0]*D
    used = [0]*N
    for i,t in enumerate(T):
        ans[i] += ans[i-1]
        t -= 1
        ans[i] += S[i][t]
        used[t] = i+1
        for j in range(N):
            ans[i] -= C[j]*(i+1-used[j])
    for v in ans:
        print(v)
    return

def examC():
    def calc_start():
        rep = [0] * D
        used = [0] * N
        for i, t in enumerate(T):
            rep[i] += rep[i - 1]
            rep[i] += S[i][t]
            used[t] = i + 1
            for j in range(N):
                rep[i] -= C[j] * (i + 1 - used[j])
        return rep

    def search(d,k):
        l = 0; r = D
        for i in range(d+1,D):
            if T[i]==k:
                r = i
                break
        for i in range(0,d)[::-1]:
            if T[i]==k:
                l = i + 1
                break
        return l, r

    def calc_cost(d,k):
        return C[k]*(d+1)*d//2

    N = 26
    D = I()
    C = LI()
    S = [LI()for _ in range(D)]
    T = [I()-1 for _ in range(D)]

    ans = calc_start()[D-1]

    

    M = I()
    for i in range(M):
        
        d, q = LI()
        d -= 1; q -= 1
        old = deepcopy(T[d])
        T[d] = q
        

        old_l, old_r = search(d,old)
        new_l, new_r = search(d,q)

        
        

        change = S[d][q] - S[d][old] \
                 - (calc_cost(old_r - old_l, old) - calc_cost(d-old_l, old) - calc_cost(old_r-d - 1, old))\
                 + (calc_cost(new_r - new_l, q) - calc_cost(d - new_l, q) - calc_cost(new_r - d - 1, q))

        ans += change

        print(ans)

    return


from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examC()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Solution (Python):
d = int(input())
c = list(map(int,input().split()))
s = []
for i in range(d):
  si = list(map(int,input().split()))
  s.append(si)
lastd = [-1 for _ in range(26)]
ans = 0
t = [0 for _ in range(d)]
for i in range(d):
  di = int(input())
  t[i] = di-1
  lastd[di-1] = i
  ans += s[i][di-1]
  for j in range(26):
    ans -= (i-lastd[j])*c[j]
m = int(input())
for _ in range(m):
  da,qa = map(int,input().split())
  da -= 1
  qa -= 1
  qb = t[da]
  t[da] = qa
  qb1 = -1
  qa1 = -1
  ans -= s[da][qb] 
  ans += s[da][qa]
  for i in range(da-1,-1,-1):
    if t[i] == qb:
      qb1 = i
      break
  for i in range(da-1,-1,-1):
    if t[i] == qa:
      qa1 = i
      break
  qb2 = d
  qa2 = d
  for i in range(da+1,d):
    if t[i] == qb:
      qb2 = i
      break
  for i in range(da+1,d):
    if t[i] == qa:
      qa2 = i
      break
  ans -= c[qb]*(qb2-da)*(da-qb1)
  ans += c[qa]*(qa2-da)*(da-qa1)
  print(ans)

Solution (Python):
d = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(d)]
t = [int(input()) for i in range(d)]
now = [0]*26

score = [0]*26
for i in range(d):
    
    now[t[i]-1] = i+1
    ind = t[i]-1
    for j in range(26):
        if j == ind:
            score[j] += s[i][ind]
        else:
            x = (i+1-now[j])*c[j]
            score[j]-= x
m = int(input())
l = [list(map(int,input().split())) for i in range(m)]
ans = sum(score)
for i in range(m):
    x,y = l[i]
    be = t[x-1]
    be -= 1
    now1 =  0
    now2 = 0
    t[x-1] = y
    y -= 1
    count1 = 0
    count2 = 0
    for j in range(d):
        if be == t[j]-1:
            now1 = j+1
            count1 +=s[j][be]
        else:
            count1 -= (j+1-now1)*c[be]
        if y == t[j]-1:
            now2 = j+1
            count2 +=s[j][y]
        else:
            count2 -= (j+1-now2)*c[y]

    ans += count1+count2-score[be]-score[y]
    print(ans)
    score[be] = count1
    score[y] = count2

Solution (Python):
import sys
import numpy as np
import numba

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

i4 = numba.int32

def get_input():
    D = int(readline())
    C = np.array(readline().split(), np.int32)
    S = np.array([readline().split() for _ in range(D)], np.int32)
    T = np.array([readline() for _ in range(D)], np.int32)
    T -= 1
    Q = int(readline())
    query = np.array(read().split(), np.int32).reshape(-1, 2)
    query -= 1
    return D, C, S, T, query

@numba.njit((i4, i4[:], i4[:, :], i4[:]), cache=True)
def first_computation(D, C, S, T):
    x = 0
    last = np.zeros((26, D), np.int32)
    for d in range(D):
        if d:
            last[:, d] = last[:, d - 1]
        i = T[d]
        x += S[d, i]
        last[i, d] = d + 1
        for i in range(26):
            x -= C[i] * (d + 1 - last[i, d])
    return last, x

@numba.njit((i4, i4[:], i4[:, :], i4[:], i4[:, :], i4, i4), cache=True)
def difference_update(D, C, S, T, last_day, d, q):
    p = T[d]
    T[d] = q
    x = S[d, q] - S[d, p]

    i = np.searchsorted(last_day[p], d + 1)
    d_p = last_day[p, i - 1] if i >= 1 else 0
    coef = 0
    for k in range(d, D):
        if last_day[p, k] == d + 1:
            
            coef += d_p - d - 1
            last_day[p, k] = d_p
        else:
            break
    x += coef * C[p]

    coef = 0
    for k in range(d, D):
        if last_day[q, k] < d + 1:
            coef += (d + 1 - last_day[q, k])
            last_day[q, k] = d + 1
        else:
            break
    x += coef * C[q]
    return x

@numba.njit((i4, i4[:], i4[:, :], i4[:], i4[:, :], i4[:, :], i4), cache=True)
def main(D, C, S, T, query, last_day, score):
    for i in range(len(query)):
        d, q = query[i]
        score += difference_update(D, C, S, T, last_day, d, q)
        print(score)

D, C, S, T, query = get_input()
last_day, score = first_computation(D, C, S, T)

main(D,C,S,T,query,last_day,score)

Solution (Python):
D=int(input())
C=list(map(int,input().split()))
S=[list(map(int,input().split())) for i in range(D)]
T=[int(input())-1 for i in range(D)]
X=[0]*26
Y=[0]*26
M=int(input())
d,q=0,0
P=0
for i in range(D):
  P+=S[i][T[i]]
  for j in range(26):
    X[j]+=C[j]
  X[T[i]]=0
  for j in range(26):
    Y[j]+=X[j]
for i in range(M):
  d,q=map(int,input().split())
  d,q=d-1,q-1
  P-=S[d][T[d]]
  P+=S[d][q]
  for j in range(26):
    X[j]=0
  Y[T[d]],Y[q]=0,0
  for j in range(D):
    if j==d:
      Z=q
    else:
      Z=T[j]
    X[T[d]]+=C[T[d]]
    X[q]+=C[q]
    X[Z]=0
    Y[T[d]]+=X[T[d]]
    Y[q]+=X[q]
  T[d]=q
  print(P-sum(Y))

Solution (Python):
from bisect import bisect_left
D = int(input())
C = list(map(int, input().split()))  
S = [list(map(int, input().split())) for _ in range(D)]
T = [int(input())-1 for _ in range(D)]
Last = [-1] * 26
def calc_pena(day):
    res = 0
    for l, c in zip(Last, C):
        res += (day-l)*c
    return res
T2 = [[-1] for _ in range(26)]
def change(day, contest):
    diff = 0
    contest_old = T[day]
    T[day] = contest
    idx = bisect_left(T2[contest_old], day)
    diff -= C[contest_old] * (T2[contest_old][idx+1] - day) * (day - T2[contest_old][idx-1])
    del T2[contest_old][idx]
    idx = bisect_left(T2[contest], day)
    diff += C[contest] * (T2[contest][idx] - day) * (day - T2[contest][idx-1])
    T2[contest].insert(idx, day)
    diff += S[day][contest] - S[day][contest_old]
    return diff

ans = 0
for i, (s, t) in enumerate(zip(S, T)):
    Last[t] = i
    ans += s[t]
    ans -= calc_pena(i)
    T2[t].append(i)
for i in range(26):
    T2[i].append(D)  

M = int(input())
DQ = [list(map(int, input().split())) for _ in range(M)]
for d, q in DQ:
    ans += change(d-1, q-1)
    print(ans)

Solution (Python):
import sys
input=lambda: sys.stdin.readline().rstrip()
import bisect
D = int(input())
C = [int(i) for i in input().split()]
S = [[int(i) for i in input().split()] for _ in range(D)]

result = 0
Date = [[0] for _ in range(26)]
Contest = [0] * D
for i in range(D):
    t = int(input())
    Contest[i] = t - 1
    result += S[i][t - 1]
    Date[t-1].append(i+1)
    for j in range(26):
        result -= C[j] * (i + 1 - Date[j][-1])

M = int(input())
for _ in range(M):
	d, q = map(int,input().split())
	d -= 1
	q -= 1
	result += S[d][q] - S[d][Contest[d]]
  
	index = bisect.bisect_left(Date[q], d + 1)
	prev = Date[q][index - 1]
	if d + 1 > Date[q][-1]:
		next = D + 1
	else:
		next = Date[q][index]
	
	result += C[q] * (d + 1 - prev) * (next - (d + 1))
	Date[q] = Date[q][:index] + [d+1] + Date[q][index:]

	index = bisect.bisect_left(Date[Contest[d]], d + 1)
	prev = Date[Contest[d]][index - 1]
	if d + 1 == Date[Contest[d]][-1]:
		next = D + 1
	else:
		next = Date[Contest[d]][index + 1]
	
	result -= C[Contest[d]] * (d + 1 - prev) * (next - (d + 1))
	Date[Contest[d]].remove(d + 1)

	Contest[d] = q

	print(result)

Solution (Python):
import bisect

D = int(input())
c = [0] + list(map(int, input().split()))
s = [0] + [[0] + list(map(int, input().split())) for _ in range(D)]
held = [[0] for _ in range(27)]

SL, sch = 0, [0]
for d in range(1, D+1):
    t = int(input())
    sch.append(t)
    held[t].append(d)
    SL += s[d][t]
    for i in range(1, 27):
        SL -= c[i] * (d - held[i][-1])
for i in range(1, 27):
    held[i].append(D+1)

M = int(input())
for i in range(M):
    d, q = map(int, input().split())

    SL += s[d][q] - s[d][sch[d]]

    ind = bisect.bisect_left(held[sch[d]], d)
    k = d - held[sch[d]][ind-1]
    l = held[sch[d]][ind+1] - d
    SL -= c[sch[d]] * k * l
    del held[sch[d]][ind]

    ind = bisect.bisect_left(held[q], d)
    held[q].insert(ind, d)
    k = d - held[q][ind-1]
    l = held[q][ind+1] - d
    SL += c[q] * k * l

    sch[d] = q
    print(SL)

Solution (Python):
import sys
input = sys.stdin.readline

D=int(input())
C=[0]+list(map(int,input().split()))
S=[0]+[[0]+list(map(int,input().split())) for i in range(D)]
T=[0]+[int(input()) for i in range(D)]

ANS=0
LAST=[[0]*27 for i in range(D+1)]
for day in range(1,D+1):
    for j in range(1,27):
        LAST[day][j]=LAST[day-1][j]
    t=T[day]
    ANS+=S[day][t]
    LAST[day][t]=day

    for j in range(1,27):
        ANS-=C[j]*(day-LAST[day][j])

    

M=int(input())
for tests in range(M):
    d,after_t=map(int,input().split())

    before_t=T[d]

    ANS+=S[d][after_t]-S[d][before_t]

    T[d]=after_t

    for day in range(d,D+1):
        if T[day]!=before_t:
            ANS+=C[before_t]*(day-LAST[day][before_t])
            LAST[day][before_t]=LAST[day-1][before_t]
            ANS-=C[before_t]*(day-LAST[day][before_t])
        else:
            break

    ANS+=C[after_t]*(d-LAST[d][after_t])
    LAST[d][after_t]=d

    for day in range(d+1,D+1):    
        if T[day]!=after_t:
            ANS+=C[after_t]*(day-LAST[day][after_t])
            LAST[day][after_t]=LAST[day-1][after_t]
            ANS-=C[after_t]*(day-LAST[day][after_t])

    print(ANS)

Solution (Python):

import sys
def input():return sys.stdin.readline()[:-1]
def N(): return int(input())
def NM():return map(int,input().split())
def L():return list(NM())
def LN(n):return [N() for i in range(n)]
def LL(n):return [L() for i in range(n)]
def Yes(x):print("Yes")if x==True else print("No")

D=N()
c=[0]+L()
s=[[0]*27]+[[0]+L() for i in range(D)]

dp=[]
T=[0]+LN(D)
sc=sum(c)
def point():
    ld=[0]*(27)
    score=-sc*((D+1)*D//2)
    for i in range(1,D+1):
        t=T[i]
        score+=s[i][t]+(i-ld[t])*(D-i+1)*c[t]
        ld[t]=i
    return score


m=N()
now=point()
for i in range(m):
    d,q=NM()
    old=T[d]
    T[d]=q
    new=point()
    print(new)

Solution (Python):
def yumiri(L, n):
  for i in range(len(L)):
    if L[i] > n:
      return i - 1

D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
t = [int(input()) for _ in range(D)]
M = int(input())
dq = [list(map(int, input().split())) for _ in range(M)]

L = [0] * 26
ZL = [[0] for _ in range(26)]
SUMD = [0] * (D + 1)
for i in range(1, D + 1):
  SUMD[i] = SUMD[i - 1] + i

ans = 0
for i in range(D):
  ans += s[i][t[i] - 1]
  for j in range(26):
    if t[i] - 1 == j:
      L[j] = 0
      ZL[j].append(i + 1)
    else:
      L[j] += 1
      ans -= L[j] * c[j]
for i in range(26):
  ZL[i].append(D + 1)

for d, q in dq:
  rd = t[d - 1] - 1
  rq = yumiri(ZL[rd], d)
  ans += SUMD[ZL[rd][rq] - ZL[rd][rq - 1] - 1] * c[rd]
  ans += SUMD[ZL[rd][rq + 1] - ZL[rd][rq] - 1] * c[rd]
  ans -= SUMD[ZL[rd][rq + 1] - ZL[rd][rq - 1] - 1] * c[rd] 
  ZL[rd].remove(d)
  
  nd = q - 1
  nq = yumiri(ZL[nd], d)
  ans += SUMD[ZL[nd][nq + 1] - ZL[nd][nq] - 1] * c[nd]
  ans -= SUMD[d - ZL[nd][nq] - 1] * c[nd]
  ans -= SUMD[ZL[nd][nq + 1] - d - 1] * c[nd]
  ZL[nd].insert(nq + 1, d)

  ans -= s[d - 1][rd]
  ans += s[d - 1][nd]

  t[d - 1] = q

  print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

d = int(input())
C = list(map(int,input().split()))
S = [list(map(int,input().split())) for i in range(d)]
T = [int(input()) for i in range(d)]
c = 26
m = int(input())
Q = [list(map(int,input().split())) for i in range(m)]

ans = 0
L = [[-1] * c for i in range(d)]

for i in range(d):
    T[i] -= 1

for i in range(d):
    L[i] = L[i-1][:]
    ans += S[i][T[i]]
    L[i][T[i]] = i
    for j in range(c):
        ans -= C[j] * (i - L[i][j])




for i in range(m):
    
    dd = Q[i][0]-1
    q = Q[i][1]-1
    ans -= S[dd][T[dd]]
    ans += S[dd][q]
    for j in range(dd, d):
        
        if T[j] == q:
            
            break
        ans += C[q] * (j - L[j][q])
        ans -= C[q] * (j - dd)
        L[j][q] = dd
    
    old = T[dd]
    T[dd] = q

    for j in range(dd, d):
        
        if T[j] == old:
            
            break
        oldl = L[j-1][old] if j > 0 else -1
        ans += C[old] * (j - dd)
        ans -= C[old] * (j - oldl)
        L[j][old] = oldl
    
    print(ans)

Solution (Python):
from bisect import bisect_left
D = int(input())
Cs = list(map(int, input().split()))
Sss = []
for _ in range(D):
    Ss = list(map(int, input().split()))
    Sss.append(Ss)

Ts = []
for _ in range(D):
    Ts.append(int(input()))

lasts = [[0] for _ in range(26)]
score = 0
for i, t in enumerate(Ts):
    d = i + 1
    t -= 1
    score += Sss[i][t]
    lasts[t].append(d)
    for j in range(26):
        score -= (d - lasts[j][-1]) * Cs[j]

for i in range(26):
    lasts[i].append(D+1)

M = int(input())
for _ in range(M):
    d, afterIdx = map(int, input().split())
    i = d - 1
    beforeIdx = Ts[i] - 1
    afterIdx -= 1

    before = lasts[beforeIdx]
    
    k = bisect_left(before, d)
    w = before[k+1] - d
    h = d - before[k-1]
    score -= Sss[i][beforeIdx]
    score -= w * h * Cs[beforeIdx]
    lasts[beforeIdx] = before[:k] + before[k+1:]

    after = lasts[afterIdx]
    
    k = bisect_left(after, d)
    w = after[k] - d
    h = d - after[k-1]
    score += Sss[i][afterIdx]
    score += w * h * Cs[afterIdx]
    lasts[afterIdx] = after[:k] + [d] + after[k:]

    Ts[i] = afterIdx + 1
    print(score)