結果

問題 No.3164 [Chery 7th Tune B] La vie en rose
コンテスト
ユーザー lif4635
提出日時 2025-05-30 22:02:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 350 ms / 2,000 ms
コード長 3,863 bytes
コンパイル時間 411 ms
コンパイル使用メモリ 82,288 KB
実行使用メモリ 121,384 KB
最終ジャッジ日時 2025-05-30 22:03:09
合計ジャッジ時間 14,388 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 34
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

class MonoidUnionFind:
    """
    mergeの順序はcompでわたせる
    小さいほうにmerge
    """
    def __init__(self, op, e, data, comp = None):
        self.n = len(data)
        self.op = op
        self.e = e
        self.par = [-1]*self.n
        self.data = data
        self.comp = comp
    
    def merge(self, a, b):
        a = self.leader(a)
        b = self.leader(b)
        if a == b: return a
        if self.comp == None:
            if -self.par[a] < -self.par[b]:
                a,b = b,a
        else:
            if self.comp(self.data[a], self.data[b]):
                a,b = b,a
        self.par[a] += self.par[b]
        self.par[b] = a
        self.data[a] = self.op(self.data[a], self.data[b])
        self.data[b] = self.e
        return a
    
    def same(self, a, b):
        return self.leader(a) == self.leader(b)
    
    def leader(self, a):
        if self.par[a] < 0: return a
        self.par[a] = self.leader(self.par[a])
        return self.par[a]
        
    def size(self, a):
        return -self.par[self.leader(a)]
    
    def set(self, a, x):
        self.data[self.leader(a)] = x
    
    def add(self, a, x):
        a = self.leader(a)
        self.data[a] = self.op(self.data[a], x)
    
    def get(self, a):
        return self.data[self.leader(a)]


n = II()
a = [0] + LI() + [0]

uf = MonoidUnionFind(lambda x, y :x + y, 0, a[:])

for i in range(n + 1):
    if a[i] > 0 and a[i+1] > 0:
        uf.merge(i, i+1)

q = II()
for _ in range(q):
    i, b = MI()
    b -= a[i]
    # print(i, b, a)
    if a[i] == 0:
        print(uf.get(i-1) + uf.get(i+1) + b)
    else:
        print(uf.get(i) + b)
0