結果
問題 | No.649 ここでちょっとQK! |
ユーザー | 👑 rin204 |
提出日時 | 2022-07-04 14:21:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 816 ms / 3,000 ms |
コード長 | 3,882 bytes |
コンパイル時間 | 316 ms |
コンパイル使用メモリ | 86,788 KB |
実行使用メモリ | 168,540 KB |
最終ジャッジ日時 | 2023-08-20 21:18:05 |
合計ジャッジ時間 | 15,000 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,256 KB |
testcase_01 | AC | 77 ms
71,296 KB |
testcase_02 | AC | 76 ms
71,256 KB |
testcase_03 | AC | 266 ms
98,284 KB |
testcase_04 | AC | 475 ms
168,492 KB |
testcase_05 | AC | 546 ms
168,540 KB |
testcase_06 | AC | 317 ms
98,100 KB |
testcase_07 | AC | 75 ms
71,356 KB |
testcase_08 | AC | 76 ms
71,288 KB |
testcase_09 | AC | 76 ms
71,180 KB |
testcase_10 | AC | 76 ms
71,176 KB |
testcase_11 | AC | 76 ms
71,312 KB |
testcase_12 | AC | 447 ms
117,032 KB |
testcase_13 | AC | 440 ms
117,180 KB |
testcase_14 | AC | 442 ms
117,428 KB |
testcase_15 | AC | 461 ms
117,352 KB |
testcase_16 | AC | 448 ms
118,076 KB |
testcase_17 | AC | 490 ms
124,528 KB |
testcase_18 | AC | 533 ms
126,576 KB |
testcase_19 | AC | 559 ms
133,576 KB |
testcase_20 | AC | 598 ms
133,532 KB |
testcase_21 | AC | 624 ms
140,496 KB |
testcase_22 | AC | 674 ms
140,008 KB |
testcase_23 | AC | 708 ms
132,532 KB |
testcase_24 | AC | 740 ms
134,220 KB |
testcase_25 | AC | 770 ms
156,860 KB |
testcase_26 | AC | 816 ms
164,484 KB |
testcase_27 | AC | 112 ms
76,512 KB |
testcase_28 | AC | 112 ms
76,328 KB |
testcase_29 | AC | 103 ms
76,352 KB |
testcase_30 | AC | 400 ms
108,680 KB |
testcase_31 | AC | 401 ms
109,268 KB |
testcase_32 | AC | 77 ms
71,292 KB |
testcase_33 | AC | 76 ms
71,312 KB |
testcase_34 | AC | 74 ms
71,032 KB |
testcase_35 | AC | 75 ms
71,132 KB |
ソースコード
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)