結果
問題 | No.1234 典型RMQ |
ユーザー | c-yan |
提出日時 | 2021-02-08 22:11:51 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,682 bytes |
コンパイル時間 | 1,289 ms |
コンパイル使用メモリ | 86,916 KB |
実行使用メモリ | 104,836 KB |
最終ジャッジ日時 | 2023-09-20 05:27:41 |
合計ジャッジ時間 | 44,389 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,164 KB |
testcase_01 | AC | 76 ms
71,160 KB |
testcase_02 | AC | 76 ms
71,036 KB |
testcase_03 | AC | 77 ms
71,360 KB |
testcase_04 | AC | 78 ms
71,412 KB |
testcase_05 | AC | 78 ms
71,200 KB |
testcase_06 | AC | 1,929 ms
103,820 KB |
testcase_07 | AC | 1,682 ms
98,796 KB |
testcase_08 | AC | 1,953 ms
104,836 KB |
testcase_09 | AC | 1,944 ms
100,900 KB |
testcase_10 | TLE | - |
testcase_11 | AC | 1,881 ms
102,468 KB |
testcase_12 | AC | 1,980 ms
101,852 KB |
testcase_13 | AC | 1,659 ms
96,596 KB |
testcase_14 | AC | 1,834 ms
101,436 KB |
testcase_15 | AC | 1,677 ms
99,356 KB |
testcase_16 | AC | 1,875 ms
103,396 KB |
testcase_17 | AC | 1,783 ms
102,280 KB |
testcase_18 | AC | 1,564 ms
96,584 KB |
testcase_19 | AC | 1,810 ms
100,804 KB |
testcase_20 | AC | 980 ms
94,344 KB |
testcase_21 | AC | 1,840 ms
101,036 KB |
testcase_22 | AC | 1,583 ms
96,656 KB |
testcase_23 | AC | 1,851 ms
99,292 KB |
testcase_24 | AC | 1,672 ms
97,524 KB |
testcase_25 | AC | 1,686 ms
100,176 KB |
testcase_26 | AC | 1,692 ms
100,092 KB |
testcase_27 | AC | 131 ms
71,400 KB |
testcase_28 | AC | 80 ms
71,404 KB |
testcase_29 | AC | 78 ms
71,384 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 _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 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')