結果
問題 | No.1234 典型RMQ |
ユーザー | c-yan |
提出日時 | 2021-02-07 03:41:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,109 ms / 2,000 ms |
コード長 | 2,679 bytes |
コンパイル時間 | 319 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 96,640 KB |
最終ジャッジ日時 | 2024-04-26 11:49:23 |
合計ジャッジ時間 | 21,040 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
52,096 KB |
testcase_01 | AC | 39 ms
52,608 KB |
testcase_02 | AC | 40 ms
52,352 KB |
testcase_03 | AC | 40 ms
52,736 KB |
testcase_04 | AC | 39 ms
52,480 KB |
testcase_05 | AC | 40 ms
52,480 KB |
testcase_06 | AC | 851 ms
90,368 KB |
testcase_07 | AC | 659 ms
85,632 KB |
testcase_08 | AC | 891 ms
96,640 KB |
testcase_09 | AC | 809 ms
87,168 KB |
testcase_10 | AC | 916 ms
93,184 KB |
testcase_11 | AC | 901 ms
90,112 KB |
testcase_12 | AC | 855 ms
87,936 KB |
testcase_13 | AC | 694 ms
85,120 KB |
testcase_14 | AC | 803 ms
87,040 KB |
testcase_15 | AC | 815 ms
87,424 KB |
testcase_16 | AC | 917 ms
93,312 KB |
testcase_17 | AC | 826 ms
87,552 KB |
testcase_18 | AC | 614 ms
83,968 KB |
testcase_19 | AC | 858 ms
95,744 KB |
testcase_20 | AC | 729 ms
93,952 KB |
testcase_21 | AC | 880 ms
90,240 KB |
testcase_22 | AC | 1,083 ms
95,488 KB |
testcase_23 | AC | 1,092 ms
96,000 KB |
testcase_24 | AC | 1,058 ms
95,360 KB |
testcase_25 | AC | 1,105 ms
96,000 KB |
testcase_26 | AC | 1,109 ms
95,232 KB |
testcase_27 | AC | 39 ms
52,224 KB |
testcase_28 | AC | 38 ms
52,224 KB |
testcase_29 | AC | 38 ms
52,608 KB |
ソースコード
from sys import stdin, setrecursionlimit 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): l = start + self._offset r = stop + self._offset while l < r: if l & 1 == 0: yield l if r & 1 == 0: yield r - 1 l = l // 2 r = (r - 1) // 2 def _propagate(self, start, stop): lazy = self._lazy values = self._values indexes = [] for i in self._iter_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._iter_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._iter_segmen_indexes(start, stop): result = op(result, values[i]) return result readline = stdin.readline setrecursionlimit(10 ** 6) 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')