結果
問題 | No.2577 Simple Permutation Guess |
ユーザー | 👑 rin204 |
提出日時 | 2023-12-05 00:45:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 582 ms / 2,000 ms |
コード長 | 2,532 bytes |
コンパイル時間 | 291 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 103,824 KB |
平均クエリ数 | 248.84 |
最終ジャッジ日時 | 2023-12-05 00:45:58 |
合計ジャッジ時間 | 32,340 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
72,156 KB |
testcase_01 | AC | 473 ms
101,076 KB |
testcase_02 | AC | 192 ms
94,120 KB |
testcase_03 | AC | 68 ms
78,080 KB |
testcase_04 | AC | 250 ms
95,384 KB |
testcase_05 | AC | 275 ms
95,768 KB |
testcase_06 | AC | 573 ms
103,824 KB |
testcase_07 | AC | 554 ms
103,696 KB |
testcase_08 | AC | 560 ms
103,692 KB |
testcase_09 | AC | 554 ms
103,820 KB |
testcase_10 | AC | 582 ms
103,688 KB |
testcase_11 | AC | 72 ms
78,080 KB |
testcase_12 | AC | 63 ms
72,156 KB |
testcase_13 | AC | 105 ms
93,028 KB |
testcase_14 | AC | 83 ms
84,728 KB |
testcase_15 | AC | 72 ms
78,080 KB |
testcase_16 | AC | 60 ms
72,156 KB |
testcase_17 | AC | 60 ms
72,156 KB |
testcase_18 | AC | 60 ms
72,156 KB |
testcase_19 | AC | 64 ms
72,156 KB |
testcase_20 | AC | 64 ms
72,156 KB |
testcase_21 | AC | 62 ms
72,156 KB |
testcase_22 | AC | 63 ms
72,148 KB |
testcase_23 | AC | 63 ms
72,148 KB |
testcase_24 | AC | 66 ms
72,148 KB |
testcase_25 | AC | 62 ms
72,148 KB |
testcase_26 | AC | 60 ms
72,148 KB |
testcase_27 | AC | 62 ms
72,148 KB |
testcase_28 | AC | 61 ms
72,148 KB |
testcase_29 | AC | 62 ms
72,148 KB |
testcase_30 | AC | 63 ms
72,148 KB |
testcase_31 | AC | 62 ms
72,156 KB |
testcase_32 | AC | 61 ms
72,156 KB |
testcase_33 | AC | 66 ms
72,156 KB |
testcase_34 | AC | 87 ms
72,156 KB |
testcase_35 | AC | 61 ms
72,156 KB |
testcase_36 | AC | 62 ms
72,156 KB |
testcase_37 | AC | 62 ms
72,148 KB |
testcase_38 | AC | 61 ms
72,148 KB |
testcase_39 | AC | 61 ms
72,148 KB |
testcase_40 | AC | 62 ms
72,148 KB |
testcase_41 | AC | 61 ms
72,148 KB |
testcase_42 | AC | 62 ms
72,148 KB |
testcase_43 | AC | 61 ms
72,148 KB |
testcase_44 | AC | 62 ms
72,148 KB |
testcase_45 | AC | 60 ms
72,148 KB |
testcase_46 | AC | 60 ms
72,148 KB |
testcase_47 | AC | 62 ms
72,148 KB |
testcase_48 | AC | 63 ms
72,148 KB |
testcase_49 | AC | 61 ms
72,148 KB |
testcase_50 | AC | 62 ms
72,148 KB |
testcase_51 | AC | 61 ms
72,148 KB |
testcase_52 | AC | 60 ms
72,148 KB |
testcase_53 | AC | 61 ms
72,148 KB |
testcase_54 | AC | 61 ms
72,148 KB |
testcase_55 | AC | 64 ms
72,148 KB |
testcase_56 | AC | 63 ms
72,148 KB |
testcase_57 | AC | 64 ms
72,148 KB |
testcase_58 | AC | 63 ms
72,148 KB |
testcase_59 | AC | 62 ms
72,148 KB |
testcase_60 | AC | 63 ms
72,148 KB |
testcase_61 | AC | 65 ms
72,148 KB |
testcase_62 | AC | 61 ms
72,148 KB |
testcase_63 | AC | 63 ms
72,148 KB |
testcase_64 | AC | 64 ms
72,148 KB |
testcase_65 | AC | 63 ms
72,148 KB |
testcase_66 | AC | 64 ms
72,148 KB |
testcase_67 | AC | 63 ms
72,148 KB |
testcase_68 | AC | 63 ms
72,148 KB |
testcase_69 | AC | 64 ms
72,148 KB |
testcase_70 | AC | 63 ms
72,148 KB |
testcase_71 | AC | 64 ms
72,148 KB |
testcase_72 | AC | 64 ms
72,148 KB |
testcase_73 | AC | 64 ms
72,156 KB |
testcase_74 | AC | 98 ms
89,940 KB |
testcase_75 | AC | 100 ms
89,944 KB |
testcase_76 | AC | 99 ms
89,944 KB |
testcase_77 | AC | 98 ms
89,940 KB |
testcase_78 | AC | 102 ms
89,940 KB |
testcase_79 | AC | 97 ms
89,940 KB |
testcase_80 | AC | 103 ms
91,108 KB |
testcase_81 | AC | 102 ms
91,216 KB |
testcase_82 | AC | 102 ms
90,852 KB |
testcase_83 | AC | 108 ms
93,000 KB |
testcase_84 | AC | 107 ms
93,000 KB |
testcase_85 | AC | 100 ms
90,980 KB |
testcase_86 | AC | 100 ms
90,852 KB |
testcase_87 | AC | 102 ms
90,852 KB |
testcase_88 | AC | 102 ms
90,852 KB |
testcase_89 | AC | 102 ms
90,852 KB |
testcase_90 | AC | 100 ms
90,980 KB |
testcase_91 | AC | 105 ms
90,852 KB |
testcase_92 | AC | 472 ms
101,836 KB |
testcase_93 | AC | 442 ms
100,080 KB |
testcase_94 | AC | 419 ms
99,608 KB |
testcase_95 | AC | 540 ms
103,064 KB |
testcase_96 | AC | 550 ms
102,948 KB |
testcase_97 | AC | 537 ms
102,176 KB |
testcase_98 | AC | 570 ms
102,172 KB |
testcase_99 | AC | 557 ms
102,624 KB |
testcase_100 | AC | 442 ms
99,864 KB |
testcase_101 | AC | 512 ms
102,044 KB |
evil_1_rnd_1.txt | AC | 999 ms
116,128 KB |
evil_1_rnd_2.txt | AC | 1,004 ms
116,360 KB |
evil_2_big_1.txt | AC | 1,199 ms
123,716 KB |
evil_2_big_2.txt | AC | 1,212 ms
123,772 KB |
evil_2_big_3.txt | AC | 1,216 ms
123,900 KB |
evil_3_sorted_1.txt | AC | 701 ms
104,316 KB |
evil_4_sorted_rev_1.txt | AC | 619 ms
104,452 KB |
evil_4_sorted_rev_2.txt | AC | 791 ms
110,300 KB |
evil_400_sorted.txt | AC | 1,173 ms
115,584 KB |
evil_400_sorted_rev.txt | AC | 1,202 ms
123,080 KB |
ソースコード
import random import math DEBUG = 0 class BIT: def __init__(self, n): self.n = n self.data = [0] * (n + 1) if n == 0: self.n0 = 0 else: self.n0 = 1 << (n.bit_length() - 1) def sum_(self, i): s = 0 while i > 0: s += self.data[i] i -= i & -i return s def sum(self, l, r=-1): if r == -1: return self.sum_(l) else: return self.sum_(r) - self.sum_(l) def get(self, i): return self.sum(i, i + 1) def add(self, i, x): i += 1 while i <= self.n: self.data[i] += x i += i & -i def lower_bound(self, x): if x <= 0: return 0 i = 0 k = self.n0 while k > 0: if i + k <= self.n and self.data[i + k] < x: x -= self.data[i + k] i += k k //= 2 return i + 1 n = int(input()) if DEBUG: ans = [i for i in range(1, n + 1)] random.shuffle(ans) qc = 0 n += 1 L = [0] * n R = [0] * n R[-1] = 1 def f(): X = [(l + r) for l, r in zip(L, R)] for i in range(n - 1): if X[i] > i: X[i] -= i + 1 X[i + 1] += 1 for i in range(n - 1, 0, -1): if X[i] % 2 == 1: X[i - 1] += i X[i] //= 2 X[0] //= 2 return X memo = {} def ask(X, q="?"): if q == "?" and tuple(X) in memo: return memo[tuple(X)] P = [] bit = BIT(n) for i in range(n): bit.add(i, 1) for x in X[::-1]: p = bit.lower_bound(x + 1) - 1 P.append(p) bit.add(p, -1) P = P[1:] print(q, *P, flush=True) if DEBUG: global qc if q == "!": assert ans == P, (ans, P) ma = math.floor(math.floor((n - 1) * math.log2(n)) - (n - 1) / 2 + 1) print(qc, ma) return qc += 1 for i in range(n - 1): if P[i] < ans[i]: memo[tuple(X)] = 1 return 1 elif P[i] > ans[i]: memo[tuple(X)] = 0 return 0 memo[tuple(X)] = 1 return 1 if len(set(P)) != n - 1: return -1 if q == "?": res = int(input()) memo[tuple(X)] = res return res while 1: mid = f() if mid == L: break res = ask(mid) if res == -1: exit() if res == 0: R = mid else: L = mid ask(L, "!")