#795898 (PyPy3) No.2065 Sum of Min

• 問題: No.2065 Sum of Min
• ユーザー: ygd.
• 提出日時: 2022-09-06 22:58:13
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 693 ms / 2,000 ms
• コード長: 2,788 bytes
• コンパイル時間: 375 ms
• コンパイル使用メモリ: 81,920 KB
• 実行使用メモリ: 109,500 KB
• 最終ジャッジ日時: 2024-11-21 23:02:46
• 合計ジャッジ時間: 15,720 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
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
94
95
96
97
98
99
100
101
102
103
104
105
import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]
def segfunc(x,y):
  return x+y
class SegmentTree(object):
    def __init__(self, A, dot, unit):
        n = 1 << (len(A) - 1).bit_length()
        tree = [unit] * (2 * n)
        for i, v in enumerate(A):
            tree[i + n] = v
        for i in range(n - 1, 0, -1):
            tree[i] = dot(tree[i << 1], tree[i << 1 | 1])
        self._n = n
        self._tree = tree
        self._dot = dot
        self._unit = unit
    def __getitem__(self, i):
        return self._tree[i + self._n]
    def update(self, i, v):
        i += self._n
        self._tree[i] = v
        while i != 1:
            i >>= 1
            self._tree[i] = self._dot(self._tree[i << 1], self._tree[i << 1 | 1])
    def add(self, i, v):
        self.update(i, self[i] + v)
    def sum(self, l, r): #これで[l,r)から取り出す。
        l += self._n
        r += self._n
        l_val = r_val = self._unit
        while l < r:
            if l & 1:
                l_val = self._dot(l_val, self._tree[l])
                l += 1
            if r & 1:
                r -= 1
                r_val = self._dot(self._tree[r], r_val)
            l >>= 1
            r >>= 1
        return self._dot(l_val, r_val)
def main():
    N,Q = map(int,input().split()); INF = pow(10,18)
    A = list(map(int,input().split()))
    PQ = []
    for i,a in enumerate(A):
        heappush(PQ,(-a,i))
    queries = []
    for i in range(Q):
        l,r,x = map(int,input().split())
        l -= 1; r -= 1
        queries.append((l,r,x,i))
    
    queries.sort(key = lambda x: x[2], reverse=True)
    ans = [-1]*Q
    originalTree = SegmentTree(A, segfunc, 0)
    changedTree = SegmentTree([0]*N, segfunc, 0) #変更されたものを1とする。
    for l,r,x,i in queries:
        # print("X",x)
        # print("pre",PQ)
        while PQ and -PQ[0][0] >= x:
            v,idx = heappop(PQ)
            v *= -1
            # print("V",v,"X",x)
            originalTree.update(idx,0)
            changedTree.update(idx,1)
        # print(PQ)
        # print(originalTree.sum(l,r+1),changedTree.sum(l,r+1))
        temp = originalTree.sum(l,r+1) + changedTree.sum(l,r+1) * x
        ans[i] = temp
    
    print(*ans,sep="\n")
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX