結果

問題 No.1675 Strange Minimum Query
ユーザー brthyyjpbrthyyjp
提出日時 2021-09-10 21:54:51
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,694 ms / 2,000 ms
コード長 4,644 bytes
コンパイル時間 1,920 ms
コンパイル使用メモリ 86,904 KB
実行使用メモリ 130,128 KB
最終ジャッジ日時 2023-09-02 17:08:27
合計ジャッジ時間 37,595 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 91 ms
71,092 KB
testcase_01 AC 93 ms
71,192 KB
testcase_02 AC 84 ms
71,200 KB
testcase_03 AC 1,133 ms
105,416 KB
testcase_04 AC 1,150 ms
106,960 KB
testcase_05 AC 376 ms
86,752 KB
testcase_06 AC 1,321 ms
110,644 KB
testcase_07 AC 1,463 ms
115,624 KB
testcase_08 AC 88 ms
75,948 KB
testcase_09 AC 147 ms
78,412 KB
testcase_10 AC 713 ms
107,056 KB
testcase_11 AC 422 ms
97,576 KB
testcase_12 AC 768 ms
109,056 KB
testcase_13 AC 818 ms
127,000 KB
testcase_14 AC 1,020 ms
130,128 KB
testcase_15 AC 888 ms
129,276 KB
testcase_16 AC 80 ms
71,444 KB
testcase_17 AC 441 ms
88,572 KB
testcase_18 AC 503 ms
89,660 KB
testcase_19 AC 701 ms
102,736 KB
testcase_20 AC 1,164 ms
114,380 KB
testcase_21 AC 1,065 ms
111,808 KB
testcase_22 AC 1,321 ms
119,920 KB
testcase_23 AC 991 ms
103,732 KB
testcase_24 AC 988 ms
105,032 KB
testcase_25 AC 752 ms
98,656 KB
testcase_26 AC 528 ms
92,788 KB
testcase_27 AC 1,022 ms
113,384 KB
testcase_28 AC 655 ms
101,432 KB
testcase_29 AC 574 ms
99,396 KB
testcase_30 AC 521 ms
93,980 KB
testcase_31 AC 1,260 ms
113,552 KB
testcase_32 AC 1,694 ms
127,236 KB
testcase_33 AC 1,669 ms
127,588 KB
testcase_34 AC 1,669 ms
128,488 KB
testcase_35 AC 1,579 ms
129,340 KB
testcase_36 AC 1,548 ms
127,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class LazySegTree:
    # RMQ and RUQ
    def __init__(self, init_val, seg_ide, lazy_ide, segfunc):
        self.n = len(init_val)
        self.num = 2**(self.n-1).bit_length()

        self.seg_ide = seg_ide
        self.lazy_ide = lazy_ide

        self.segfunc = segfunc

        # seg, lazy: 1-indexed
        self.seg = [seg_ide]*2*self.num
        for i in range(self.n):
            self.seg[i+self.num] = init_val[i]
        for i in range(self.num-1, 0, -1):
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

        self.lazy = [lazy_ide]*2*self.num

    def gindex(self, l, r):
        # l, r: 1-indexed
        L = l + self.num
        R = r + self.num
        lm = (L // (L & -L)) >> 1
        rm = (R // (R & -R)) >> 1
        while L < R:
            if R <= rm:
                yield R
            if L <= lm:
                yield L
            L = L >> 1
            R = R >> 1
        while L:
            yield L
            L = L >> 1

    def propagate(self, *ids):
        # ids: 1-indexed
        for i in reversed(ids):
            v = self.lazy[i]
            if v is None:
                continue
            self.lazy[2*i] = self.lazy[2*i+1] = self.seg[2*i] = self.seg[2*i+1] = v
            self.lazy[i] = None

    def update(self, l, r, x):
        # l, r: 0-indexed
        # change x to [l, r)
        *ids, = self.gindex(l, r)
        self.propagate(*ids)
        L = l + self.num
        R = r + self.num
        while L < R:
            if R & 1:
                R -= 1
                self.lazy[R] = self.seg[R] = x
            if L & 1:
                self.lazy[L] = self.seg[L] = x
                L += 1
            L = L >> 1
            R = R >> 1
        for i in ids:
            # i: 1-indexed
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

    def query(self, l, r):
        # l, r: 0-indexed
        # query for [l, r)
        if r <= l:
            return self.seg_ide

        self.propagate(*self.gindex(l, r))
        L = l + self.num
        R = r + self.num
        res = self.seg_ide
        while L < R:
            if R & 1:
                R -= 1
                res = self.segfunc(res, self.seg[R])
            if L & 1:
                res = self.segfunc(self.seg[L], res)
                L += 1
            L = L >> 1
            R = R >> 1
        return res

    def __str__(self): # for debug
        arr = [self.query(i,i+1) for i in range(self.n)]
        return str(arr)

class SegTree:
    def __init__(self, init_val, ide_ele, segfunc):
        self.n = len(init_val)
        self.num = 2**(self.n-1).bit_length()
        self.ide_ele = ide_ele
        self.segfunc = segfunc
        self.seg = [ide_ele]*2*self.num
        # set_val
        for i in range(self.n):
            self.seg[i+self.num] = init_val[i]
        # built
        for i in range(self.num-1, 0, -1):
            self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])

    def update(self, k, x):
        k += self.num
        self.seg[k] = x
        while k:
            k = k >> 1
            self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])

    def query(self, l, r):
        if r <= l:
            return self.ide_ele
        l += self.num
        r += self.num
        lres = self.ide_ele
        rres = self.ide_ele
        while l < r:
            if r & 1:
                r -= 1
                rres = self.segfunc(self.seg[r], rres)
            if l & 1:
                lres = self.segfunc(lres, self.seg[l])
                l += 1
            l = l >> 1
            r = r >> 1
        res = self.segfunc(lres, rres)
        return res

    def __str__(self): # for debug
        arr = [self.query(i,i+1) for i in range(self.n)]
        return str(arr)
def segfunc(x, y):
    if x <= y:
        return x
    else:
        return y

INF = 10**18

import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

def main():

    n, q = map(int, input().split())
    LR = []
    for i in range(q):
        l, r, b = map(int, input().split())
        l, r = l-1, r-1
        LR.append((l, r, b))
    seg = LazySegTree([INF]*n, INF, None, segfunc)
    LR.sort(key=lambda x: x[2])
    #print(LR)
    for l, r, b in LR:
        seg.update(l, r+1, b)
    A = [INF]*n
    for i in range(n):
        a = seg.query(i, i+1)
        if a == INF:
            A[i] = 10**9
        else:
            A[i] = a

    seg = SegTree(A, INF, segfunc)
    for l, r, b in LR:
        x = seg.query(l, r+1)
        if x != b:
            print(-1)
            exit()
    else:
        print(*A)

if __name__ == '__main__':
    main()
0