#849888 (PyPy3) No.2065 Sum of Min

• 問題: No.2065 Sum of Min
• ユーザー: mkawa2
• 提出日時: 2023-03-17 19:02:09
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 552 ms / 2,000 ms
• コード長: 2,098 bytes
• コンパイル時間: 204 ms
• コンパイル使用メモリ: 82,156 KB
• 実行使用メモリ: 109,272 KB
• 最終ジャッジ日時: 2024-09-18 10:07:36
• 合計ジャッジ時間: 12,179 ms
• ジャッジサーバーID （参考情報）: judge3 / 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
import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n
        self._origin = [0]*n
    def __getitem__(self, item):
        return self._origin[item]
    def add(self, i, x):
        self._origin[i] += x
        i += 1
        while i < self._n:
            self._table[i] += x
            i += i & -i
    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self._table[i]
            i -= i & -i
        return res
    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)
    # return "min(i) of sum(i)>=x" or "N"
    def bisect(self, x):
        idx = 0
        d = 1 << (self._n-1).bit_length()-1
        while d:
            if idx+d < self._n and self._table[idx+d] < x:
                x -= self._table[idx+d]
                idx |= d
            d >>= 1
        return idx
n, q = LI()
aa = LI()
ia = sorted(enumerate(aa), key=lambda x: -x[1])
lrx = [[i]+LI() for i in range(q)]
lrx.sort(key=lambda x: x[3])
# pDB(lrx)
sbit = BitSum(n)
cbit = BitSum(n)
ans = [0]*q
for ai, l, r, x in lrx:
    while ia and ia[-1][-1] <= x:
        i, a = ia.pop()
        sbit.add(i, a)
        cbit.add(i, 1)
    s = sbit.sumlr(l-1, r)
    c = cbit.sumlr(l-1, r)
    ans[ai] = s+(r-l+1-c)*x
print(*ans, sep="\n")
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX