結果
問題 | No.2065 Sum of Min |
ユーザー | tassei903 |
提出日時 | 2022-09-02 22:28:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,396 ms / 2,000 ms |
コード長 | 1,964 bytes |
コンパイル時間 | 389 ms |
コンパイル使用メモリ | 87,060 KB |
実行使用メモリ | 214,584 KB |
最終ジャッジ日時 | 2023-08-10 04:44:07 |
合計ジャッジ時間 | 24,388 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
71,408 KB |
testcase_01 | AC | 66 ms
71,328 KB |
testcase_02 | AC | 67 ms
71,284 KB |
testcase_03 | AC | 71 ms
71,588 KB |
testcase_04 | AC | 662 ms
158,348 KB |
testcase_05 | AC | 605 ms
157,472 KB |
testcase_06 | AC | 1,004 ms
135,076 KB |
testcase_07 | AC | 448 ms
133,696 KB |
testcase_08 | AC | 1,048 ms
137,688 KB |
testcase_09 | AC | 1,245 ms
214,380 KB |
testcase_10 | AC | 1,302 ms
213,952 KB |
testcase_11 | AC | 1,288 ms
213,780 KB |
testcase_12 | AC | 1,369 ms
214,584 KB |
testcase_13 | AC | 1,373 ms
213,664 KB |
testcase_14 | AC | 1,346 ms
213,584 KB |
testcase_15 | AC | 1,368 ms
214,120 KB |
testcase_16 | AC | 1,396 ms
214,584 KB |
testcase_17 | AC | 1,354 ms
214,048 KB |
testcase_18 | AC | 1,314 ms
214,392 KB |
testcase_19 | AC | 1,317 ms
213,996 KB |
testcase_20 | AC | 1,323 ms
213,968 KB |
testcase_21 | AC | 1,325 ms
214,184 KB |
ソースコード
import sys input = lambda :sys.stdin.readline()[:-1] ni = lambda :int(input()) na = lambda :list(map(int,input().split())) yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES") no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO") ####################################################################### # Binary Indexed Tree (Fenwick Tree) # 0-indexed class BIT: def __init__(self, n): self.n = n self.data = [0]*(n+1) self.el = [0]*(n+1) def sum(self, i): s = 0 while i > 0: s += self.data[i] i -= i & -i return s def add(self, i, x): assert 0 <= i < self.n i = i+1 self.el[i] += x while i <= self.n: self.data[i] += x i += i & -i def set(self, i, x): assert 0 <= i <= self.n self.add(i,x-self.get(i)) def get(self, i, j=None):# j=Noneのときiを取得, [i, j)の和を取得 if j is None: return self.el[i+1] return self.sum(j) - self.sum(i) n, q = na() a = na() s = list(a) event = [] for i in range(q): l,r,x = na() event.append((l-1,0,x, i)) event.append((r-1,2,x, i)) s.append(x) s = sorted(set(s)) d = {x:i for i, x in enumerate(s)} m = len(s) bit1 = BIT(m) bit2 = BIT(m) for i in range(n): event.append((i, 1, a[i])) ans = [0] * q for eve in sorted(event): if eve[1] == 0: x = eve[2] i = eve[3] ans[i] -= bit2.get(0, d[x]) + x * bit1.get(d[x], m) elif eve[1] == 1: x = eve[2] bit1.add(d[x], 1) bit2.add(d[x], x) else: x = eve[2] i = eve[3] ans[i] += bit2.get(0, d[x]) + x * bit1.get(d[x], m) """print(eve) for j in range(m): print(bit1.get(j),end = " ") print() for j in range(m): print(bit2.get(j),end = " ") print() print(*ans)""" for i in ans: print(i)