結果
問題 | No.1234 典型RMQ |
ユーザー | c-yan |
提出日時 | 2021-02-08 22:15:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,008 ms / 2,000 ms |
コード長 | 3,043 bytes |
コンパイル時間 | 318 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 94,720 KB |
最終ジャッジ日時 | 2024-04-26 11:49:52 |
合計ジャッジ時間 | 19,870 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
53,248 KB |
testcase_01 | AC | 39 ms
52,736 KB |
testcase_02 | AC | 39 ms
52,608 KB |
testcase_03 | AC | 39 ms
52,864 KB |
testcase_04 | AC | 40 ms
52,736 KB |
testcase_05 | AC | 41 ms
52,480 KB |
testcase_06 | AC | 829 ms
90,664 KB |
testcase_07 | AC | 695 ms
86,196 KB |
testcase_08 | AC | 821 ms
94,080 KB |
testcase_09 | AC | 797 ms
88,808 KB |
testcase_10 | AC | 907 ms
92,032 KB |
testcase_11 | AC | 806 ms
91,264 KB |
testcase_12 | AC | 796 ms
89,144 KB |
testcase_13 | AC | 645 ms
86,504 KB |
testcase_14 | AC | 752 ms
87,064 KB |
testcase_15 | AC | 750 ms
87,952 KB |
testcase_16 | AC | 869 ms
92,272 KB |
testcase_17 | AC | 778 ms
88,456 KB |
testcase_18 | AC | 603 ms
86,496 KB |
testcase_19 | AC | 814 ms
93,952 KB |
testcase_20 | AC | 576 ms
93,156 KB |
testcase_21 | AC | 813 ms
89,992 KB |
testcase_22 | AC | 935 ms
94,268 KB |
testcase_23 | AC | 1,008 ms
94,336 KB |
testcase_24 | AC | 974 ms
94,628 KB |
testcase_25 | AC | 932 ms
94,036 KB |
testcase_26 | AC | 948 ms
94,720 KB |
testcase_27 | AC | 40 ms
52,352 KB |
testcase_28 | AC | 40 ms
52,480 KB |
testcase_29 | AC | 40 ms
52,864 KB |
ソースコード
from sys import stdin class SegmentTree: DEFAULT_VALUE = 10 ** 18 DEFAULT_LAZY = 0 op = min def __init__(self, size): self._size = size t = 1 while t < size: t *= 2 self._offset = t - 1 self._values = [SegmentTree.DEFAULT_VALUE] * (t * 2 - 1) self._lazy = [SegmentTree.DEFAULT_LAZY] * (t * 2 - 1) def build(self, iterable): op = SegmentTree.op values = self._values values[self._offset:self._offset + self._size] = iterable for i in range(self._offset - 1, -1, -1): values[i] = SegmentTree.op(values[i * 2 + 1], values[i * 2 + 2]) def _iter_segmen_indexes(self, start, stop): rs = [] l = start + self._offset r = stop + self._offset while l < r: if l & 1 == 0: yield l if r & 1 == 0: rs.append(r - 1) l = l // 2 r = (r - 1) // 2 yield from rs[::-1] def _get_segmen_indexes(self, start, stop): ls = [] rs = [] l = start + self._offset r = stop + self._offset while l < r: if l & 1 == 0: ls.append(l) if r & 1 == 0: rs.append(r - 1) l = l // 2 r = (r - 1) // 2 return ls + rs[::-1] def _propagate(self, start, stop): lazy = self._lazy values = self._values indexes = [] for i in self._get_segmen_indexes(start, stop): if i == 0: return while i != 0: i = (i - 1) // 2 indexes.append(i) for i in sorted(set(indexes)): l = lazy[i] if l == SegmentTree.DEFAULT_LAZY: continue lazy[i * 2 + 1] += l values[i * 2 + 1] += l lazy[i * 2 + 2] += l values[i * 2 + 2] += l lazy[i] = SegmentTree.DEFAULT_LAZY def apply(self, start, stop, value): op = SegmentTree.op values = self._values lazy = self._lazy self._propagate(start, stop) for i in self._get_segmen_indexes(start, stop): lazy[i] += value values[i] += value while i >= 1: i = (i - 1) // 2 values[i] = op(values[i * 2 + 1], values[i * 2 + 2]) def query(self, start, stop): op = SegmentTree.op values = self._values self._propagate(start, stop) result = SegmentTree.DEFAULT_VALUE for i in self._get_segmen_indexes(start, stop): result = op(result, values[i]) return result readline = stdin.readline N = int(readline()) a = list(map(int, readline().split())) Q = int(readline()) st = SegmentTree(N) st.build(a) result = [] for _ in range(Q): k, l, r, c = map(int, readline().split()) if k == 1: st.apply(l - 1, r, c) elif k == 2: result.append(st.query(l - 1, r)) print(*result, sep='\n')