結果

問題 No.1675 Strange Minimum Query
ユーザー brthyyjpbrthyyjp
提出日時 2021-09-10 21:51:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,647 ms / 2,000 ms
コード長 4,403 bytes
コンパイル時間 275 ms
コンパイル使用メモリ 87,264 KB
実行使用メモリ 144,628 KB
最終ジャッジ日時 2023-09-02 16:59:24
合計ジャッジ時間 35,139 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
71,360 KB
testcase_01 AC 69 ms
71,504 KB
testcase_02 AC 68 ms
71,304 KB
testcase_03 AC 1,037 ms
107,916 KB
testcase_04 AC 1,045 ms
112,428 KB
testcase_05 AC 351 ms
93,384 KB
testcase_06 AC 1,205 ms
112,772 KB
testcase_07 AC 1,333 ms
120,940 KB
testcase_08 AC 80 ms
76,244 KB
testcase_09 AC 129 ms
78,028 KB
testcase_10 AC 677 ms
117,220 KB
testcase_11 AC 381 ms
104,740 KB
testcase_12 AC 740 ms
120,760 KB
testcase_13 AC 746 ms
134,588 KB
testcase_14 AC 1,000 ms
144,628 KB
testcase_15 AC 917 ms
143,968 KB
testcase_16 AC 69 ms
71,056 KB
testcase_17 AC 421 ms
91,260 KB
testcase_18 AC 485 ms
93,224 KB
testcase_19 AC 686 ms
114,496 KB
testcase_20 AC 1,130 ms
124,144 KB
testcase_21 AC 1,077 ms
123,536 KB
testcase_22 AC 1,312 ms
132,232 KB
testcase_23 AC 975 ms
108,952 KB
testcase_24 AC 963 ms
113,544 KB
testcase_25 AC 724 ms
101,664 KB
testcase_26 AC 495 ms
97,312 KB
testcase_27 AC 985 ms
126,664 KB
testcase_28 AC 620 ms
110,100 KB
testcase_29 AC 554 ms
110,348 KB
testcase_30 AC 504 ms
97,076 KB
testcase_31 AC 1,210 ms
119,496 KB
testcase_32 AC 1,647 ms
141,220 KB
testcase_33 AC 1,640 ms
141,508 KB
testcase_34 AC 1,625 ms
141,604 KB
testcase_35 AC 1,422 ms
142,264 KB
testcase_36 AC 1,459 ms
142,156 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)

INF = 10**18

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

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, min)
LR.sort(key=lambda x: x[2])
#print(LR)
for l, r, b in LR:
    seg.update(l, r+1, b)
A = []
for i in range(n):
    a = seg.query(i, i+1)
    if a == INF:
        A.append(10**9)
    else:
        A.append(a)

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