結果
問題 | No.1234 典型RMQ |
ユーザー | c-yan |
提出日時 | 2021-02-07 03:17:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,862 ms / 2,000 ms |
コード長 | 2,758 bytes |
コンパイル時間 | 326 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 96,512 KB |
最終ジャッジ日時 | 2024-11-09 02:39:55 |
合計ジャッジ時間 | 30,779 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
52,608 KB |
testcase_01 | AC | 43 ms
52,608 KB |
testcase_02 | AC | 43 ms
52,480 KB |
testcase_03 | AC | 44 ms
52,608 KB |
testcase_04 | AC | 44 ms
52,480 KB |
testcase_05 | AC | 43 ms
52,480 KB |
testcase_06 | AC | 1,214 ms
91,648 KB |
testcase_07 | AC | 911 ms
87,424 KB |
testcase_08 | AC | 1,222 ms
96,512 KB |
testcase_09 | AC | 1,343 ms
89,344 KB |
testcase_10 | AC | 1,311 ms
93,312 KB |
testcase_11 | AC | 1,236 ms
92,672 KB |
testcase_12 | AC | 1,139 ms
89,344 KB |
testcase_13 | AC | 964 ms
87,552 KB |
testcase_14 | AC | 1,636 ms
90,368 KB |
testcase_15 | AC | 1,360 ms
90,496 KB |
testcase_16 | AC | 1,264 ms
93,312 KB |
testcase_17 | AC | 1,016 ms
89,984 KB |
testcase_18 | AC | 1,013 ms
87,936 KB |
testcase_19 | AC | 1,862 ms
96,000 KB |
testcase_20 | AC | 1,234 ms
94,720 KB |
testcase_21 | AC | 1,145 ms
92,160 KB |
testcase_22 | AC | 1,741 ms
96,128 KB |
testcase_23 | AC | 1,591 ms
96,000 KB |
testcase_24 | AC | 1,740 ms
96,128 KB |
testcase_25 | AC | 1,533 ms
96,000 KB |
testcase_26 | AC | 1,470 ms
96,128 KB |
testcase_27 | AC | 44 ms
52,352 KB |
testcase_28 | AC | 44 ms
52,352 KB |
testcase_29 | AC | 43 ms
52,480 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_to(self, index, value): self._lazy[index] += value self._values[index] += value def _propagate_at(self, index): if index != 0: self._propagate_at((index - 1) // 2) lazy = self._lazy[index] if lazy == SegmentTree.DEFAULT_LAZY: return self._propagate_to(index * 2 + 1, lazy) self._propagate_to(index * 2 + 2, lazy) self._lazy[index] = SegmentTree.DEFAULT_LAZY def _propagate(self, start, stop): for i in self._iter_segmen_indexes(start, stop): if i != 0: self._propagate_at((i - 1) // 2) def _apply_to(self, index, value): op = SegmentTree.op values = self._values self._lazy[index] += value values[index] += value while index >= 1: index = (index - 1) // 2 values[index] = op(values[index * 2 + 1], values[index * 2 + 2]) def apply(self, start, stop, value): self._propagate(start, stop) for i in self._iter_segmen_indexes(start, stop): self._apply_to(i, value) 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')