結果

問題 No.649 ここでちょっとQK！
ユーザー ntudantuda
提出日時 2024-10-23 00:10:45
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 700 ms / 3,000 ms
コード長 4,123 bytes
コンパイル時間 379 ms
コンパイル使用メモリ 82,288 KB
実行使用メモリ 165,656 KB
最終ジャッジ日時 2024-10-23 00:11:00
合計ジャッジ時間 14,108 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
68,904 KB
testcase_01 AC 60 ms
69,876 KB
testcase_02 AC 62 ms
69,360 KB
testcase_03 AC 265 ms
93,012 KB
testcase_04 AC 404 ms
165,656 KB
testcase_05 AC 402 ms
165,572 KB
testcase_06 AC 371 ms
104,584 KB
testcase_07 AC 61 ms
69,256 KB
testcase_08 AC 61 ms
69,492 KB
testcase_09 AC 61 ms
67,948 KB
testcase_10 AC 61 ms
69,984 KB
testcase_11 AC 62 ms
68,508 KB
testcase_12 AC 353 ms
120,080 KB
testcase_13 AC 380 ms
117,324 KB
testcase_14 AC 353 ms
117,440 KB
testcase_15 AC 367 ms
117,384 KB
testcase_16 AC 362 ms
116,644 KB
testcase_17 AC 419 ms
125,028 KB
testcase_18 AC 428 ms
129,404 KB
testcase_19 AC 453 ms
137,096 KB
testcase_20 AC 505 ms
140,300 KB
testcase_21 AC 502 ms
141,668 KB
testcase_22 AC 550 ms
151,564 KB
testcase_23 AC 539 ms
154,440 KB
testcase_24 AC 611 ms
154,664 KB
testcase_25 AC 594 ms
162,320 KB
testcase_26 AC 700 ms
162,444 KB
testcase_27 AC 97 ms
78,212 KB
testcase_28 AC 99 ms
77,928 KB
testcase_29 AC 95 ms
78,104 KB
testcase_30 AC 317 ms
111,172 KB
testcase_31 AC 315 ms
110,476 KB
testcase_32 AC 62 ms
69,128 KB
testcase_33 AC 65 ms
68,364 KB
testcase_34 AC 62 ms
68,576 KB
testcase_35 AC 61 ms
68,444 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 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])


Q, K = map(int, input().split())
A = set()
TK = []
for _ in range(Q):
    tk = tuple(map(int, input().split()))
    if tk[0] == 1:
        TK.append(tk)
        A.add(tk[1])
    else:
        TK.append((tk[0], 0))

NA = len(A)
A = sorted(list(A))
D = dict(zip(A, range(NA)))
base = [0] * (NA + 1)
ST = SegTree(lambda x, y: x + y, 0, base)
for t, k in TK:
    if t == 1:
        base[D[k]] += 1
        ST.set(D[k], base[D[k]])
    else:
        x = ST.max_right(0, lambda v: v < K)
        if x < NA:
            base[x] -= 1
            ST.set(x, base[x])
            print(A[x])
        else:
            print(-1)
0