結果

問題 No.1234 典型RMQ
ユーザー toyuzukotoyuzuko
提出日時 2020-09-21 23:20:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 400 ms / 2,000 ms
コード長 4,970 bytes
コンパイル時間 165 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 94,720 KB
最終ジャッジ日時 2024-04-26 11:31:48
合計ジャッジ時間 10,051 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
53,760 KB
testcase_01 AC 42 ms
53,504 KB
testcase_02 AC 42 ms
53,888 KB
testcase_03 AC 42 ms
53,248 KB
testcase_04 AC 41 ms
53,760 KB
testcase_05 AC 42 ms
53,632 KB
testcase_06 AC 361 ms
88,832 KB
testcase_07 AC 332 ms
83,800 KB
testcase_08 AC 379 ms
94,592 KB
testcase_09 AC 352 ms
86,964 KB
testcase_10 AC 400 ms
92,288 KB
testcase_11 AC 373 ms
88,960 KB
testcase_12 AC 370 ms
86,208 KB
testcase_13 AC 353 ms
83,044 KB
testcase_14 AC 347 ms
85,776 KB
testcase_15 AC 343 ms
85,260 KB
testcase_16 AC 383 ms
91,776 KB
testcase_17 AC 362 ms
85,976 KB
testcase_18 AC 329 ms
82,988 KB
testcase_19 AC 381 ms
94,564 KB
testcase_20 AC 304 ms
93,696 KB
testcase_21 AC 365 ms
89,356 KB
testcase_22 AC 368 ms
94,720 KB
testcase_23 AC 364 ms
94,208 KB
testcase_24 AC 363 ms
94,208 KB
testcase_25 AC 364 ms
94,080 KB
testcase_26 AC 374 ms
94,336 KB
testcase_27 AC 42 ms
53,376 KB
testcase_28 AC 41 ms
53,632 KB
testcase_29 AC 44 ms
53,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class LazySegmentTree():
    def __init__(self, n, op, e, mapping, composition, id):
        self.n = n
        self.op = op
        self.e = e
        self.mapping = mapping
        self.composition = composition
        self.id = id
        self.log = (n - 1).bit_length()
        self.size = 1 << self.log
        self.d = [e] * (2 * self.size)
        self.lz = [id] * (self.size)

    def update(self, k):
        self.d[k] = self.op(self.d[2 * k], self.d[2 * k + 1])

    def all_apply(self, k, f):
        self.d[k] = self.mapping(f, self.d[k])
        if k < self.size:
            self.lz[k] = self.composition(f, self.lz[k])

    def push(self, k):
        self.all_apply(2 * k, self.lz[k])
        self.all_apply(2 * k + 1, self.lz[k])
        self.lz[k] = self.id

    def build(self, arr):
        #assert len(arr) == self.n
        for i, a in enumerate(arr):
            self.d[self.size + i] = a
        for i in range(1, self.size)[::-1]:
            self.update(i)

    def set(self, p, x):
        #assert 0 <= p < self.n
        p += self.size
        for i in range(1, self.log + 1)[::-1]:
            self.push(p >> i)
        self.d[p] = x
        for i in range(1, self.log + 1):
            self.update(p >> i)

    def get(self, p):
        #assert 0 <= p < self.n
        p += self.size
        for i in range(1, self.log + 1):
            self.push(p >> i)
        return self.d[p]

    def prod(self, l, r):
        #assert 0 <= l <= r <= self.n
        if l == r: return self.e
        l += self.size
        r += self.size
        for i in range(1, self.log + 1)[::-1]:
            if ((l >> i) << i) != l: self.push(l >> i)
            if ((r >> i) << i) != r: self.push(r >> i)
        sml = smr = self.e
        while l < r:
            if l & 1:
                sml = self.op(sml, self.d[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.d[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        return self.d[1]

    def apply(self, p, f):
        #assert 0 <= p < self.n
        p += self.size
        for i in range(1, self.log + 1)[::-1]:
            self.push(p >> i)
        self.d[p] = self.mapping(f, self.d[p])
        for i in range(1, self.log + 1):
            self.update(p >> i)

    def range_apply(self, l, r, f):
        #assert 0 <= l <= r <= self.n
        if l == r: return
        l += self.size
        r += self.size
        for i in range(1, self.log + 1)[::-1]:
            if ((l >> i) << i) != l: self.push(l >> i)
            if ((r >> i) << i) != r: self.push((r - 1) >> i)
        l2 = l
        r2 = r
        while l < r:
            if l & 1:
                self.all_apply(l, f)
                l += 1
            if r & 1:
                r -= 1
                self.all_apply(r, f)
            l >>= 1
            r >>= 1
        l = l2
        r = r2
        for i in range(1, self.log + 1):
            if ((l >> i) << i) != l: self.update(l >> i)
            if ((r >> i) << i) != r: self.update((r - 1) >> i)

    def max_right(self, l, g):
        #assert 0 <= l <= self.n
        #assert g(self.e)
        if l == self.n: return self.n
        l += self.size
        for i in range(1, self.log + 1)[::-1]:
            self.push(l >> i)
        sm = self.e
        while True:
            while l % 2 == 0: l >>= 1
            if not g(self.op(sm, self.d[l])):
                while l < self.size:
                    self.push(l)
                    l = 2 * l
                    if g(self.op(sm, self.d[l])):
                        sm = self.op(sm, self.d[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.d[l])
            l += 1
            if (l & -l) == l: return self.n

    def min_left(self, r, g):
        #assert 0 <= r <= self.n
        #assert g(self.e)
        if r == 0: return 0
        r += self.size
        for i in range(1, self.log + 1)[::-1]:
            self.push((r - 1) >> i)
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r % 2: r >>= 1
            if not g(self.op(self.d[r], sm)):
                while r < self.size:
                    self.push(r)
                    r = 2 * r + 1
                    if g(self.op(self.d[r], sm)):
                        sm = self.op(self.d[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.d[r], sm)
            if (r & -r) == r: return 0

import sys
input = sys.stdin.buffer.readline

from operator import add

N = int(input())
A = tuple(map(int, input().split()))

lst = LazySegmentTree(N, min, 10**18, add, add, 0)
lst.build(A)
res = []

Q = int(input())

for _ in range(Q):
    k, l, r, c = map(int, input().split())
    if k == 1:
        lst.range_apply(l - 1, r, c)
    else:
        res.append(lst.prod(l - 1, r))

print('\n'.join(map(str, res)))
0