結果

問題 No.1675 Strange Minimum Query
ユーザー yudai1102jpyudai1102jp
提出日時 2021-09-10 23:30:01
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,832 ms / 2,000 ms
コード長 6,999 bytes
コンパイル時間 377 ms
コンパイル使用メモリ 87,340 KB
実行使用メモリ 133,184 KB
最終ジャッジ日時 2023-09-02 22:25:04
合計ジャッジ時間 41,140 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 176 ms
80,336 KB
testcase_01 AC 177 ms
80,208 KB
testcase_02 AC 170 ms
80,336 KB
testcase_03 AC 981 ms
102,964 KB
testcase_04 AC 937 ms
102,280 KB
testcase_05 AC 358 ms
90,196 KB
testcase_06 AC 1,140 ms
105,120 KB
testcase_07 AC 1,167 ms
107,840 KB
testcase_08 AC 193 ms
82,112 KB
testcase_09 AC 299 ms
85,288 KB
testcase_10 AC 809 ms
115,944 KB
testcase_11 AC 485 ms
106,096 KB
testcase_12 AC 839 ms
117,028 KB
testcase_13 AC 867 ms
129,304 KB
testcase_14 AC 1,057 ms
127,816 KB
testcase_15 AC 929 ms
129,332 KB
testcase_16 AC 172 ms
80,272 KB
testcase_17 AC 724 ms
96,760 KB
testcase_18 AC 791 ms
100,036 KB
testcase_19 AC 876 ms
115,488 KB
testcase_20 AC 1,341 ms
119,776 KB
testcase_21 AC 1,216 ms
123,392 KB
testcase_22 AC 1,425 ms
127,952 KB
testcase_23 AC 1,249 ms
109,480 KB
testcase_24 AC 1,185 ms
113,768 KB
testcase_25 AC 1,053 ms
106,620 KB
testcase_26 AC 787 ms
102,876 KB
testcase_27 AC 1,143 ms
123,524 KB
testcase_28 AC 877 ms
111,924 KB
testcase_29 AC 766 ms
112,932 KB
testcase_30 AC 776 ms
102,504 KB
testcase_31 AC 1,481 ms
121,740 KB
testcase_32 AC 1,783 ms
133,184 KB
testcase_33 AC 1,730 ms
132,764 KB
testcase_34 AC 1,832 ms
132,556 KB
testcase_35 AC 1,645 ms
131,840 KB
testcase_36 AC 1,709 ms
131,044 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing


def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


def _bsf(n: int) -> int:
    x = 0
    while n % 2 == 0:
        x += 1
        n //= 2

    return x


class LazySegTree:
    def __init__(
            self,
            op: typing.Callable[[typing.Any, typing.Any], typing.Any],
            e: typing.Any,
            mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],
            composition: typing.Callable[[typing.Any, typing.Any], typing.Any],
            id_: typing.Any,
            v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e
        self._mapping = mapping
        self._composition = composition
        self._id = id_

        if isinstance(v, int):
            v = [e] * v

        self._n = len(v)
        self._log = _ceil_pow2(self._n)
        self._size = 1 << self._log
        self._d = [e] * (2 * self._size)
        self._lz = [self._id] * self._size
        for i in range(self._n):
            self._d[self._size + i] = v[i]
        for i in range(self._size - 1, 0, -1):
            self._update(i)

    def set(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += self._size
        for i in range(self._log, 0, -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: int) -> typing.Any:
        assert 0 <= p < self._n

        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        if left == right:
            return self._e

        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push(right >> i)

        sml = self._e
        smr = self._e
        while left < right:
            if left & 1:
                sml = self._op(sml, self._d[left])
                left += 1
            if right & 1:
                right -= 1
                smr = self._op(self._d[right], smr)
            left >>= 1
            right >>= 1

        return self._op(sml, smr)

    def all_prod(self) -> typing.Any:
        return self._d[1]

    def apply(self, left: int, right: typing.Optional[int] = None,
              f: typing.Optional[typing.Any] = None) -> None:
        assert f is not None

        if right is None:
            p = left
            assert 0 <= left < self._n

            p += self._size
            for i in range(self._log, 0, -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)
        else:
            assert 0 <= left <= right <= self._n
            if left == right:
                return

            left += self._size
            right += self._size

            for i in range(self._log, 0, -1):
                if ((left >> i) << i) != left:
                    self._push(left >> i)
                if ((right >> i) << i) != right:
                    self._push((right - 1) >> i)

            l2 = left
            r2 = right
            while left < right:
                if left & 1:
                    self._all_apply(left, f)
                    left += 1
                if right & 1:
                    right -= 1
                    self._all_apply(right, f)
                left >>= 1
                right >>= 1
            left = l2
            right = r2

            for i in range(1, self._log + 1):
                if ((left >> i) << i) != left:
                    self._update(left >> i)
                if ((right >> i) << i) != right:
                    self._update((right - 1) >> i)

    def max_right(
            self, left: int, g: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert g(self._e)

        if left == self._n:
            return self._n

        left += self._size
        for i in range(self._log, 0, -1):
            self._push(left >> i)

        sm = self._e
        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not g(self._op(sm, self._d[left])):
                while left < self._size:
                    self._push(left)
                    left *= 2
                    if g(self._op(sm, self._d[left])):
                        sm = self._op(sm, self._d[left])
                        left += 1
                return left - self._size
            sm = self._op(sm, self._d[left])
            left += 1

        return self._n

    def min_left(self, right: int, g: typing.Any) -> int:
        assert 0 <= right <= self._n
        assert g(self._e)

        if right == 0:
            return 0

        right += self._size
        for i in range(self._log, 0, -1):
            self._push((right - 1) >> i)

        sm = self._e
        first = True
        while first or (right & -right) != right:
            first = False
            right -= 1
            while right > 1 and right % 2:
                right >>= 1
            if not g(self._op(self._d[right], sm)):
                while right < self._size:
                    self._push(right)
                    right = 2 * right + 1
                    if g(self._op(self._d[right], sm)):
                        sm = self._op(self._d[right], sm)
                        right -= 1
                return right + 1 - self._size
            sm = self._op(self._d[right], sm)

        return 0

    def _update(self, k: int) -> None:
        self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])

    def _all_apply(self, k: int, f: typing.Any) -> None:
        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: int) -> None:
        self._all_apply(2 * k, self._lz[k])
        self._all_apply(2 * k + 1, self._lz[k])
        self._lz[k] = self._id


def op(x, y):
    return min(x, y)


e = int(1e9)+1


def mapping(f, x):
    if f == e:
        return x
    return f


def composition(f, x):
    if f == e:
        return x
    return f


id = e


N, Q = map(int, input().split())
lrB = [[int(i) for i in input().split()] for j in range(Q)]
lrB.sort(key=lambda x: x[2])
lag = LazySegTree(op, e, mapping, composition, id, [int(1e9)]*N)

for i in range(Q):
    l, r, B = lrB[i]
    l -= 1
    lag.apply(l, r, B)

for i in range(Q):
    l, r, B = lrB[i]
    l -= 1
    if lag.prod(l, r) != B:
        print(-1)
        exit()
ans = [0]*N
for i in range(N):
    ans[i] = lag.get(i)
print(' '.join(list(map(str, ans))))
0