結果
問題 | No.1705 Mode of long array |
ユーザー |
![]() |
提出日時 | 2021-10-08 23:39:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 319 ms / 3,000 ms |
コード長 | 4,327 bytes |
コンパイル時間 | 207 ms |
コンパイル使用メモリ | 82,552 KB |
実行使用メモリ | 107,672 KB |
最終ジャッジ日時 | 2024-07-23 08:00:54 |
合計ジャッジ時間 | 14,385 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
68,720 KB |
testcase_01 | AC | 62 ms
68,224 KB |
testcase_02 | AC | 62 ms
67,956 KB |
testcase_03 | AC | 104 ms
78,820 KB |
testcase_04 | AC | 104 ms
78,972 KB |
testcase_05 | AC | 107 ms
78,680 KB |
testcase_06 | AC | 134 ms
79,648 KB |
testcase_07 | AC | 131 ms
79,688 KB |
testcase_08 | AC | 136 ms
79,452 KB |
testcase_09 | AC | 127 ms
79,628 KB |
testcase_10 | AC | 130 ms
79,328 KB |
testcase_11 | AC | 133 ms
79,924 KB |
testcase_12 | AC | 129 ms
79,960 KB |
testcase_13 | AC | 249 ms
100,044 KB |
testcase_14 | AC | 208 ms
85,296 KB |
testcase_15 | AC | 197 ms
80,924 KB |
testcase_16 | AC | 219 ms
81,884 KB |
testcase_17 | AC | 190 ms
80,900 KB |
testcase_18 | AC | 181 ms
80,780 KB |
testcase_19 | AC | 233 ms
82,936 KB |
testcase_20 | AC | 194 ms
81,672 KB |
testcase_21 | AC | 220 ms
96,336 KB |
testcase_22 | AC | 273 ms
105,948 KB |
testcase_23 | AC | 198 ms
79,220 KB |
testcase_24 | AC | 200 ms
79,132 KB |
testcase_25 | AC | 198 ms
79,392 KB |
testcase_26 | AC | 206 ms
79,584 KB |
testcase_27 | AC | 198 ms
79,964 KB |
testcase_28 | AC | 176 ms
78,764 KB |
testcase_29 | AC | 187 ms
79,164 KB |
testcase_30 | AC | 197 ms
79,592 KB |
testcase_31 | AC | 199 ms
78,920 KB |
testcase_32 | AC | 176 ms
78,724 KB |
testcase_33 | AC | 292 ms
107,324 KB |
testcase_34 | AC | 304 ms
107,268 KB |
testcase_35 | AC | 306 ms
107,072 KB |
testcase_36 | AC | 309 ms
107,336 KB |
testcase_37 | AC | 307 ms
107,124 KB |
testcase_38 | AC | 311 ms
107,276 KB |
testcase_39 | AC | 308 ms
107,172 KB |
testcase_40 | AC | 311 ms
107,344 KB |
testcase_41 | AC | 292 ms
107,236 KB |
testcase_42 | AC | 319 ms
107,672 KB |
testcase_43 | AC | 178 ms
106,900 KB |
testcase_44 | AC | 216 ms
107,460 KB |
testcase_45 | AC | 222 ms
107,072 KB |
testcase_46 | AC | 207 ms
107,280 KB |
testcase_47 | AC | 216 ms
107,380 KB |
testcase_48 | AC | 219 ms
106,804 KB |
testcase_49 | AC | 285 ms
107,260 KB |
testcase_50 | AC | 289 ms
107,172 KB |
testcase_51 | AC | 300 ms
107,228 KB |
testcase_52 | AC | 287 ms
107,432 KB |
testcase_53 | AC | 288 ms
107,520 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] 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)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**19 # md = 998244353 md = 10**9+7 import typing class SegTree: def __init__(self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e if isinstance(v, int): v = [e]*v self._n = len(v) self._log = (self._n-1).bit_length() self._size = 1 << self._log self._d = [e]*(2*self._size) for i in range(self._n): self._d[self._size+i] = v[i] for i in range(self._size-1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size self._d[p] = x for i in range(1, self._log+1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n return self._d[p+self._size] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n sml = self._e smr = self._e left += self._size right += self._size while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def max_right(self, left: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert f(self._e) if left == self._n: return self._n left += self._size sm = self._e first = True while first or (left & -left) != left: first = False while left%2 == 0: left >>= 1 if not f(self._op(sm, self._d[left])): while left < self._size: left *= 2 if f(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left-self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= right <= self._n assert f(self._e) if right == 0: return 0 right += self._size sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right%2: right >>= 1 if not f(self._op(self._d[right], sm)): while right < self._size: right = 2*right+1 if f(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right+1-self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2*k], self._d[2*k+1]) def op(a, b): if a > b: return a return b e = (-1, -1) n, m = LI() aa = [0]+LI() seg = SegTree(op, e, [(a, i) for i, a in enumerate(aa)]) for _ in range(II()): t, x, y = LI() if t == 1: c, _ = seg.get(x) seg.set(x, (c+y, x)) elif t == 2: c, _ = seg.get(x) seg.set(x, (c-y, x)) else: _, a = seg.all_prod() print(a)