結果

問題 No.1675 Strange Minimum Query
ユーザー mkawa2mkawa2
提出日時 2021-09-10 21:47:30
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,451 bytes
コンパイル時間 1,460 ms
コンパイル使用メモリ 86,776 KB
実行使用メモリ 137,944 KB
最終ジャッジ日時 2023-09-02 16:48:34
合計ジャッジ時間 41,964 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
71,232 KB
testcase_01 AC 77 ms
71,108 KB
testcase_02 AC 74 ms
71,236 KB
testcase_03 AC 1,140 ms
107,544 KB
testcase_04 AC 987 ms
105,744 KB
testcase_05 AC 274 ms
85,364 KB
testcase_06 AC 1,233 ms
113,084 KB
testcase_07 AC 1,316 ms
116,060 KB
testcase_08 AC 93 ms
76,064 KB
testcase_09 AC 210 ms
79,504 KB
testcase_10 AC 845 ms
108,928 KB
testcase_11 AC 459 ms
98,208 KB
testcase_12 AC 953 ms
112,940 KB
testcase_13 AC 924 ms
124,716 KB
testcase_14 AC 1,280 ms
130,980 KB
testcase_15 AC 1,059 ms
132,208 KB
testcase_16 AC 74 ms
71,276 KB
testcase_17 AC 596 ms
89,744 KB
testcase_18 AC 693 ms
93,948 KB
testcase_19 AC 830 ms
106,480 KB
testcase_20 AC 1,410 ms
117,204 KB
testcase_21 AC 1,304 ms
117,780 KB
testcase_22 AC 1,607 ms
126,164 KB
testcase_23 AC 1,327 ms
112,556 KB
testcase_24 AC 1,220 ms
111,104 KB
testcase_25 AC 995 ms
102,208 KB
testcase_26 AC 696 ms
97,348 KB
testcase_27 AC 1,169 ms
115,980 KB
testcase_28 AC 814 ms
103,908 KB
testcase_29 AC 688 ms
105,360 KB
testcase_30 AC 673 ms
96,084 KB
testcase_31 AC 1,613 ms
120,320 KB
testcase_32 TLE -
testcase_33 AC 1,952 ms
137,868 KB
testcase_34 AC 1,985 ms
137,012 KB
testcase_35 AC 1,929 ms
134,396 KB
testcase_36 AC 1,877 ms
137,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**20
md = 998244353
# md = 10**9+7

class LazySegTree:
    def __init__(self, op, e, mapping, composition, _id, v):
        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 = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._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, x):
        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):
        p += self._size
        for i in range(self._log, 0, -1):
            self._push(p >> i)
        return self._d[p]

    def prod(self, left, right):
        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):
        return self._d[1]

    def apply(self, left, right, f):
        if right is None:
            p = left
            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:
            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, g):
        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, g):
        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):
        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

mx=10**9

# treeのマージ
# 32bit以上を区間長とした例
def op(x, y):
    return min(x,y)

# treeの単位元
e = mx

# lazy(f)からtree(x)への操作
def mapping(f, x):
    if f==inf:return x
    return f

# lazyの下への分解
def composition(f, g):
    if f==inf:return g
    return f

# lazyの単位元
_id = inf


n,q=LI()
aa=[mx]*n
lrb=[]
seg = LazySegTree(op, e, mapping, composition, _id, n)
for _ in range(q):
    l,r,b=LI()
    l-=1
    lrb.append((l,r,b))

lrb.sort(key=lambda x:x[2])

for l,r,b in lrb:
    seg.apply(l,r,b)

def ok():
    for l,r,b in lrb:
        if seg.prod(l,r)!=b:return False
    return True

if ok():
    ans=[]
    for i in range(n):
        ans.append(seg.get(i))
    print(*ans)
else:
    print(-1)
0