#795327 (PyPy3) No.2065 Sum of Min

• 問題: No.2065 Sum of Min
• ユーザー: Navier_Boltzmann
• 提出日時: 2022-09-03 20:44:25
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,219 ms / 2,000 ms
• コード長: 2,240 bytes
• コンパイル時間: 365 ms
• コンパイル使用メモリ: 81,976 KB
• 実行使用メモリ: 142,112 KB
• 最終ジャッジ日時: 2024-11-17 11:49:51
• 合計ジャッジ時間: 22,598 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline
N,Q = map(int,input().split())
A = list(map(int,input().split()))
class SegTree:
    """
    Segment Tree
    """
    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化
        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])
    def update(self, k, x):
        """
        k番目の値をxに更新
        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1
    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る
        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res
        
        
S = list(accumulate([0]+A))
query = [tuple(map(int,input().split())) for _ in range(Q)]
T = SegTree([(A[i],i) for i in range(N)],max,(-1,-1))
U = SegTree([0]*N,lambda x,y:x+y,0)
V = SegTree([0]*N,lambda x,y:x+y,0)
X = [(x,l,r) for l,r,x in query]
X.sort(reverse=True)
ans = defaultdict(int)
for i in range(Q):
    x,l,r = X[i]
    t = (l,r,x)
    
    while T.query(0,N)[0] >= x:
        j = T.query(0,N)[1]
        V.update(j,A[j])
        U.update(j,1)
        T.update(j,(-1,-1))
    l -= 1
    
    tans = S[r]-S[l] - V.query(l,r) + x*U.query(l,r)
    ans[t] = tans
for q in query:
    print(ans[q])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX