結果

問題 No.2065 Sum of Min
ユーザー aaaaaaaaaa2230
提出日時 2022-09-02 22:48:05
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 805 ms / 2,000 ms
コード長 1,642 bytes
コンパイル時間 567 ms
コンパイル使用メモリ 82,636 KB
実行使用メモリ 106,960 KB
最終ジャッジ日時 2024-11-16 05:15:31
合計ジャッジ時間 16,133 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

class BIT:
def __init__(self, n):
self.size = n
self.tree = [0]*(n+1)
def build(self, list):
self.tree[1:] = list.copy()
for i in range(self.size+1):
j = i + (i & (-i))
if j < self.size+1:
self.tree[j] += self.tree[i]
def sum(self, i):
# [0, i)
s = 0
while i>0:
s += self.tree[i]
i -= i & -i
return s
# 0 index 1 index 1
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
# xindex binary search
def bsearch(self,x):
le = 0
ri = 1<<(self.size.bit_length()-1)
while ri > 0:
if le+ri <= self.size and self.tree[le+ri]<x:
x -= self.tree[le+ri]
le += ri
ri >>= 1
return le+1
n,q = map(int,input().split())
A = list(map(int,input().split()))
Q = []
for i in range(q):
l,r,x = map(int,input().split())
Q.append([i,l,r,x])
ans = [0]*q
bit_sum = BIT(n+5)
bit_num = BIT(n+5)
SA = [[a,i+1] for i,a in enumerate(A)]
SA.sort()
Q.sort(key=lambda x: x[3])
now = 0
for ind,l,r,x in Q:
while now < n and SA[now][0] <= x:
a,i = SA[now]
bit_sum.add(i,a)
bit_num.add(i,1)
now += 1
num = bit_num.sum(r+1)-bit_num.sum(l)
count = bit_sum.sum(r+1)-bit_sum.sum(l) + (r-l+1-num)*x
# print(l,r,x,num,count,now)
ans[ind] = count
for i in ans:
print(i)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0