結果
問題 | No.1705 Mode of long array |
ユーザー | mkawa2 |
提出日時 | 2021-10-08 23:39:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 383 ms / 3,000 ms |
コード長 | 4,327 bytes |
コンパイル時間 | 259 ms |
コンパイル使用メモリ | 87,260 KB |
実行使用メモリ | 110,464 KB |
最終ジャッジ日時 | 2023-09-30 13:58:10 |
合計ジャッジ時間 | 19,160 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 161 ms
80,856 KB |
testcase_01 | AC | 165 ms
80,644 KB |
testcase_02 | AC | 165 ms
80,652 KB |
testcase_03 | AC | 203 ms
83,208 KB |
testcase_04 | AC | 196 ms
82,984 KB |
testcase_05 | AC | 197 ms
83,228 KB |
testcase_06 | AC | 228 ms
83,932 KB |
testcase_07 | AC | 227 ms
84,164 KB |
testcase_08 | AC | 231 ms
84,484 KB |
testcase_09 | AC | 227 ms
84,040 KB |
testcase_10 | AC | 230 ms
84,396 KB |
testcase_11 | AC | 228 ms
84,116 KB |
testcase_12 | AC | 224 ms
83,852 KB |
testcase_13 | AC | 338 ms
104,076 KB |
testcase_14 | AC | 301 ms
95,896 KB |
testcase_15 | AC | 300 ms
86,088 KB |
testcase_16 | AC | 310 ms
87,156 KB |
testcase_17 | AC | 289 ms
86,544 KB |
testcase_18 | AC | 279 ms
85,976 KB |
testcase_19 | AC | 320 ms
90,272 KB |
testcase_20 | AC | 286 ms
89,268 KB |
testcase_21 | AC | 306 ms
101,452 KB |
testcase_22 | AC | 354 ms
109,860 KB |
testcase_23 | AC | 295 ms
83,988 KB |
testcase_24 | AC | 293 ms
84,088 KB |
testcase_25 | AC | 289 ms
84,004 KB |
testcase_26 | AC | 294 ms
84,284 KB |
testcase_27 | AC | 294 ms
83,948 KB |
testcase_28 | AC | 268 ms
83,436 KB |
testcase_29 | AC | 269 ms
83,620 KB |
testcase_30 | AC | 290 ms
83,552 KB |
testcase_31 | AC | 292 ms
83,700 KB |
testcase_32 | AC | 269 ms
83,580 KB |
testcase_33 | AC | 355 ms
109,880 KB |
testcase_34 | AC | 376 ms
109,416 KB |
testcase_35 | AC | 380 ms
109,416 KB |
testcase_36 | AC | 383 ms
109,616 KB |
testcase_37 | AC | 369 ms
109,516 KB |
testcase_38 | AC | 364 ms
109,516 KB |
testcase_39 | AC | 375 ms
109,504 KB |
testcase_40 | AC | 376 ms
109,444 KB |
testcase_41 | AC | 359 ms
109,768 KB |
testcase_42 | AC | 377 ms
109,616 KB |
testcase_43 | AC | 264 ms
109,844 KB |
testcase_44 | AC | 303 ms
110,208 KB |
testcase_45 | AC | 305 ms
110,140 KB |
testcase_46 | AC | 294 ms
110,100 KB |
testcase_47 | AC | 304 ms
110,136 KB |
testcase_48 | AC | 303 ms
110,464 KB |
testcase_49 | AC | 364 ms
109,456 KB |
testcase_50 | AC | 370 ms
110,016 KB |
testcase_51 | AC | 375 ms
109,384 KB |
testcase_52 | AC | 362 ms
109,448 KB |
testcase_53 | AC | 369 ms
109,756 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)