結果

問題 No.649 ここでちょっとQK！
ユーザー rin204rin204
提出日時 2022-07-04 14:21:39
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 673 ms / 3,000 ms
コード長 3,882 bytes
コンパイル時間 708 ms
コンパイル使用メモリ 82,272 KB
実行使用メモリ 168,288 KB
最終ジャッジ日時 2024-05-08 03:37:45
合計ジャッジ時間 12,937 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
52,832 KB
testcase_01 AC 38 ms
53,436 KB
testcase_02 AC 37 ms
53,696 KB
testcase_03 AC 199 ms
97,324 KB
testcase_04 AC 387 ms
168,288 KB
testcase_05 AC 406 ms
168,164 KB
testcase_06 AC 252 ms
97,192 KB
testcase_07 AC 36 ms
53,008 KB
testcase_08 AC 36 ms
53,616 KB
testcase_09 AC 38 ms
53,780 KB
testcase_10 AC 38 ms
54,228 KB
testcase_11 AC 37 ms
53,548 KB
testcase_12 AC 363 ms
116,772 KB
testcase_13 AC 364 ms
116,660 KB
testcase_14 AC 341 ms
116,864 KB
testcase_15 AC 374 ms
117,164 KB
testcase_16 AC 364 ms
117,484 KB
testcase_17 AC 396 ms
112,988 KB
testcase_18 AC 429 ms
126,624 KB
testcase_19 AC 456 ms
134,188 KB
testcase_20 AC 490 ms
132,804 KB
testcase_21 AC 530 ms
140,684 KB
testcase_22 AC 560 ms
139,596 KB
testcase_23 AC 612 ms
138,392 KB
testcase_24 AC 644 ms
134,292 KB
testcase_25 AC 672 ms
156,468 KB
testcase_26 AC 673 ms
142,276 KB
testcase_27 AC 73 ms
73,156 KB
testcase_28 AC 68 ms
72,856 KB
testcase_29 AC 63 ms
70,652 KB
testcase_30 AC 335 ms
108,868 KB
testcase_31 AC 339 ms
110,096 KB
testcase_32 AC 37 ms
53,944 KB
testcase_33 AC 37 ms
53,392 KB
testcase_34 AC 37 ms
53,396 KB
testcase_35 AC 36 ms
53,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class Binary_Trie_Vertex:
    def __init__(self):
        self.left = None
        self.right = None
        self.parent = None
        self.size = 0

class Binary_Trie:
    def __init__(self, logn, ismulti = False):
        self.logn = logn
        self.root = Binary_Trie_Vertex()
        self.bi = [1 << i for i in range(logn)]
        self.multi = ismulti
        
    def add(self, x):
        V = self.root
        plus = False
        for i in range(self.logn - 1, -1, -1):
            if x >> i & 1:
                if V.right is None:
                    V.right = Binary_Trie_Vertex()
                    V.right.parent = V
                    plus = True
                V = V.right
                
            else:
                if V.left is None:
                    V.left = Binary_Trie_Vertex()
                    V.left.parent = V
                    plus = True
                V = V.left
        if plus or self.multi:
            while V.parent is not None:
                V.size += 1
                V = V.parent
            V.size += 1

    def remove(self, x):
        V = self.root
        for i in range(self.logn - 1, -1, -1):
            if x >> i & 1:
                if V.right is None:
                    return False
                V = V.right
            else:
                if V.left is None:
                    return False
                V = V.left
        V2 = V
        while V2.parent is not None:
            V2.size -= 1
            V2 = V2.parent
        V2.size -= 1
        while V.size == 0 and V != self.root:
            P = V.parent
            if P.right == V:
                P.right = None
            else:
                P.left = None
            if P.right is None and P.left is None:
                pass
            else:
                return True
            V = P
        return True
    
    def search(self, x):
        V = self.root
        for i in range(self.logn - 1, -1, -1):
            if x >> i & 1:
                if V.right is None:
                    return False
                V = V.right
            else:
                if V.left is None:
                    return False
                V = V.left
        return True
    
    def xor_min(self, x):
        xor = 0
        V = self.root
        for i in range(self.logn - 1, -1, -1):
            if x >> i & 1:
                if V.right is not None:
                    V = V.right
                else:
                    xor += self.bi[i]
                    V = V.left
            else:
                if V.left is not None:
                    V = V.left
                else:
                    xor += self.bi[i]
                    V = V.right
        return xor
        
    def __getitem__(self, k):
        return self.Kth_element(k)
    
    def Kth_element(self, k):
        if k < 0:
            k = self.root.size + k
        k += 1
        if k > self.root.size or k <= 0:
            return None
        ret = 0
        V = self.root
        for i in range(self.logn - 1, -1, -1):
            if V.left is None:
                ret += self.bi[i]
                V = V.right
            elif V.right is None:
                V = V.left
            elif V.left.size >= k:
                V = V.left
            else:
                ret += self.bi[i]
                k -= V.left.size
                V = V.right
        return ret

Q, k = map(int, input().split())
query = [list(map(int, input().split())) for _ in range(Q)]
se = set()
for tmp in query:
    if tmp[0] == 1:
        se.add(tmp[1])
lst = sorted(se)
dic = {l:i for i, l in enumerate(lst)}
le = len(lst)
bt = Binary_Trie(le.bit_length(), True)

for tmp in query:
    if tmp[0] == 1:
        bt.add(dic[tmp[1]])
    else:
        ans = bt[k - 1]
        if ans is None:
            print(-1)
        else:
            print(lst[ans])
            bt.remove(ans)
0