#1019916 (PyPy3) No.2930 Larger Mex

提出ソース

結果

問題	No.2930 Larger Mex
ユーザー	ntuda
提出日時	2024-10-16 22:12:06
言語	PyPy3 (7.3.15)
結果	AC
実行時間	553 ms / 2,000 ms
コード長	4,216 bytes
コンパイル時間	356 ms
コンパイル使用メモリ	82,304 KB
実行使用メモリ	119,180 KB
最終ジャッジ日時	2024-10-16 22:12:33
合計ジャッジ時間	25,762 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	59 ms 68,224 KB
testcase_01	AC	57 ms 67,968 KB
testcase_02	AC	58 ms 67,584 KB
testcase_03	AC	116 ms 79,232 KB
testcase_04	AC	120 ms 79,736 KB
testcase_05	AC	129 ms 79,744 KB
testcase_06	AC	121 ms 79,288 KB
testcase_07	AC	146 ms 79,232 KB
testcase_08	AC	461 ms 114,452 KB
testcase_09	AC	425 ms 110,948 KB
testcase_10	AC	494 ms 115,872 KB
testcase_11	AC	405 ms 106,624 KB
testcase_12	AC	500 ms 117,580 KB
testcase_13	AC	515 ms 116,556 KB
testcase_14	AC	503 ms 118,124 KB
testcase_15	AC	460 ms 108,736 KB
testcase_16	AC	438 ms 107,288 KB
testcase_17	AC	509 ms 115,628 KB
testcase_18	AC	449 ms 108,992 KB
testcase_19	AC	548 ms 117,520 KB
testcase_20	AC	530 ms 117,344 KB
testcase_21	AC	513 ms 117,052 KB
testcase_22	AC	519 ms 117,824 KB
testcase_23	AC	487 ms 112,320 KB
testcase_24	AC	487 ms 114,648 KB
testcase_25	AC	542 ms 118,308 KB
testcase_26	AC	396 ms 115,220 KB
testcase_27	AC	348 ms 107,464 KB
testcase_28	AC	381 ms 111,268 KB
testcase_29	AC	410 ms 111,640 KB
testcase_30	AC	135 ms 112,620 KB
testcase_31	AC	125 ms 104,428 KB
testcase_32	AC	137 ms 112,912 KB
testcase_33	AC	138 ms 114,136 KB
testcase_34	AC	528 ms 117,420 KB
testcase_35	AC	366 ms 97,916 KB
testcase_36	AC	553 ms 116,496 KB
testcase_37	AC	471 ms 113,204 KB
testcase_38	AC	483 ms 116,704 KB
testcase_39	AC	480 ms 116,696 KB
testcase_40	AC	529 ms 117,060 KB
testcase_41	AC	477 ms 111,680 KB
testcase_42	AC	406 ms 111,256 KB
testcase_43	AC	415 ms 108,312 KB
testcase_44	AC	394 ms 108,172 KB
testcase_45	AC	391 ms 108,036 KB
testcase_46	AC	96 ms 78,284 KB
testcase_47	AC	96 ms 78,212 KB
testcase_48	AC	85 ms 78,208 KB
testcase_49	AC	90 ms 78,208 KB
testcase_50	AC	434 ms 112,332 KB
testcase_51	AC	552 ms 119,180 KB
testcase_52	AC	546 ms 118,988 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

import typing

class SegTree:
    def __init__(self,
                 op: typing.Callable[[typing.Any, typing.Any], typing.Any],
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        self._op = op
        self._e = e

        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)

        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
        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

        return self._d[p + self._size]

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

        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 max_right(self, left: int,
                  f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= left <= self._n
        assert f(self._e)

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

        left += self._size
        sm = self._e

        first = True
        while first or (left & -left) != left:
            first = False
            while left % 2 == 0:
                left >>= 1
            if not f(self._op(sm, self._d[left])):
                while left < self._size:
                    left *= 2
                    if f(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,
                 f: typing.Callable[[typing.Any], bool]) -> int:
        assert 0 <= right <= self._n
        assert f(self._e)

        if right == 0:
            return 0

        right += self._size
        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 f(self._op(self._d[right], sm)):
                while right < self._size:
                    right = 2 * right + 1
                    if f(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])

N, M = map(int, input().split())
if M == 0:
    for i in range(N):
        print(N - i)
    exit()

A = list(map(int, input().split()))
INF = N + 10
base = [0] * (N + 1)
ST = SegTree(min, INF, base)
imos = [0] * (N + 1)
j = 0
mexn = -1
for i in range(N):
    while j < N and mexn < M:
        a = A[j]
        if a <= N:
            base[a] += 1
            ST.set(a, base[a])
            mexn = ST.max_right(0, lambda v: v > 0)
        j += 1
    if M <= mexn < N + 1:
        imos[j - i - 1] += 1
        imos[N - i] -= 1
    a = A[i]
    if a <= N:
        base[a] -= 1
        ST.set(a, base[a])
        mexn = ST.max_right(0, lambda v: v > 0)
now = 0
for i in range(N):
    now += imos[i]
    print(now)

yukicoder

結果

テストケース

ソースコード