結果

問題 No.649 ここでちょっとQK！
ユーザー 👑 rin204rin204
提出日時 2022-07-04 14:16:37
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 3,706 bytes
コンパイル時間 1,195 ms
コンパイル使用メモリ 86,860 KB
実行使用メモリ 658,412 KB
最終ジャッジ日時 2023-08-20 21:11:30
合計ジャッジ時間 30,868 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
71,360 KB
testcase_01 AC 60 ms
71,104 KB
testcase_02 AC 60 ms
71,028 KB
testcase_03 AC 418 ms
78,092 KB
testcase_04 AC 376 ms
110,620 KB
testcase_05 AC 374 ms
110,424 KB
testcase_06 AC 302 ms
78,444 KB
testcase_07 AC 61 ms
71,368 KB
testcase_08 AC 60 ms
71,092 KB
testcase_09 AC 60 ms
71,300 KB
testcase_10 AC 60 ms
71,432 KB
testcase_11 AC 62 ms
71,312 KB
testcase_12 AC 875 ms
352,932 KB
testcase_13 AC 860 ms
351,356 KB
testcase_14 AC 838 ms
339,088 KB
testcase_15 AC 965 ms
371,848 KB
testcase_16 AC 1,181 ms
395,024 KB
testcase_17 AC 1,467 ms
416,520 KB
testcase_18 AC 1,514 ms
443,660 KB
testcase_19 AC 1,517 ms
475,916 KB
testcase_20 AC 1,605 ms
509,392 KB
testcase_21 MLE -
testcase_22 MLE -
testcase_23 MLE -
testcase_24 MLE -
testcase_25 MLE -
testcase_26 MLE -
testcase_27 AC 149 ms
76,996 KB
testcase_28 AC 94 ms
76,988 KB
testcase_29 AC 97 ms
77,148 KB
testcase_30 AC 340 ms
89,452 KB
testcase_31 AC 370 ms
91,644 KB
testcase_32 AC 62 ms
71,204 KB
testcase_33 AC 60 ms
71,240 KB
testcase_34 AC 61 ms
71,156 KB
testcase_35 AC 63 ms
70,884 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())
bt = Binary_Trie(60, True)

for _ in range(Q):
    query = list(map(int, input().split()))
    if query[0] == 1:
        bt.add(query[1])
    else:
        ans = bt[k - 1]
        if ans is None:
            print(-1)
        else:
            print(ans)
            bt.remove(ans)
0