結果

問題 No.2577 Simple Permutation Guess
ユーザー 👑 rin204rin204
提出日時 2023-12-05 00:43:49
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 2,609 bytes
コンパイル時間 170 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 104,740 KB
平均クエリ数 248.84
最終ジャッジ日時 2024-09-26 23:47:02
合計ジャッジ時間 30,885 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
71,392 KB
testcase_01 AC 454 ms
102,152 KB
testcase_02 AC 205 ms
94,920 KB
testcase_03 AC 70 ms
77,280 KB
testcase_04 AC 253 ms
96,280 KB
testcase_05 AC 284 ms
96,964 KB
testcase_06 AC 543 ms
104,472 KB
testcase_07 AC 553 ms
104,352 KB
testcase_08 AC 546 ms
104,096 KB
testcase_09 AC 551 ms
104,740 KB
testcase_10 AC 538 ms
104,604 KB
testcase_11 AC 74 ms
78,952 KB
testcase_12 AC 64 ms
71,648 KB
testcase_13 AC 117 ms
93,792 KB
testcase_14 AC 93 ms
85,216 KB
testcase_15 AC 74 ms
77,408 KB
testcase_16 AC 65 ms
71,216 KB
testcase_17 AC 65 ms
70,488 KB
testcase_18 AC 64 ms
70,880 KB
testcase_19 AC 66 ms
70,752 KB
testcase_20 AC 64 ms
70,880 KB
testcase_21 RE -
testcase_22 AC 65 ms
71,128 KB
testcase_23 AC 65 ms
71,256 KB
testcase_24 AC 65 ms
71,128 KB
testcase_25 AC 64 ms
71,384 KB
testcase_26 AC 65 ms
71,544 KB
testcase_27 AC 65 ms
71,256 KB
testcase_28 AC 65 ms
71,512 KB
testcase_29 AC 66 ms
71,128 KB
testcase_30 AC 67 ms
71,000 KB
testcase_31 AC 65 ms
71,568 KB
testcase_32 AC 65 ms
70,880 KB
testcase_33 AC 70 ms
71,264 KB
testcase_34 AC 67 ms
71,392 KB
testcase_35 AC 66 ms
71,128 KB
testcase_36 AC 64 ms
71,392 KB
testcase_37 RE -
testcase_38 AC 66 ms
70,872 KB
testcase_39 RE -
testcase_40 AC 64 ms
71,136 KB
testcase_41 AC 64 ms
71,648 KB
testcase_42 AC 63 ms
70,624 KB
testcase_43 AC 63 ms
71,392 KB
testcase_44 AC 66 ms
71,776 KB
testcase_45 AC 66 ms
71,264 KB
testcase_46 AC 64 ms
71,264 KB
testcase_47 AC 63 ms
71,520 KB
testcase_48 AC 63 ms
71,264 KB
testcase_49 AC 63 ms
71,128 KB
testcase_50 AC 66 ms
71,128 KB
testcase_51 AC 65 ms
71,000 KB
testcase_52 AC 63 ms
71,256 KB
testcase_53 AC 63 ms
71,384 KB
testcase_54 AC 64 ms
71,000 KB
testcase_55 AC 66 ms
71,128 KB
testcase_56 AC 66 ms
71,256 KB
testcase_57 AC 66 ms
71,256 KB
testcase_58 AC 65 ms
71,384 KB
testcase_59 AC 65 ms
70,872 KB
testcase_60 AC 64 ms
71,256 KB
testcase_61 AC 66 ms
71,512 KB
testcase_62 AC 66 ms
71,128 KB
testcase_63 RE -
testcase_64 AC 66 ms
71,000 KB
testcase_65 AC 67 ms
71,512 KB
testcase_66 AC 66 ms
71,160 KB
testcase_67 AC 65 ms
71,256 KB
testcase_68 AC 67 ms
71,256 KB
testcase_69 AC 65 ms
71,128 KB
testcase_70 AC 65 ms
71,512 KB
testcase_71 AC 66 ms
71,256 KB
testcase_72 AC 67 ms
71,384 KB
testcase_73 AC 66 ms
71,136 KB
testcase_74 AC 110 ms
90,456 KB
testcase_75 AC 110 ms
90,592 KB
testcase_76 AC 109 ms
90,720 KB
testcase_77 AC 111 ms
90,976 KB
testcase_78 AC 109 ms
90,336 KB
testcase_79 RE -
testcase_80 AC 110 ms
92,128 KB
testcase_81 AC 113 ms
91,488 KB
testcase_82 AC 112 ms
91,744 KB
testcase_83 AC 117 ms
93,408 KB
testcase_84 AC 115 ms
93,912 KB
testcase_85 AC 111 ms
92,128 KB
testcase_86 RE -
testcase_87 AC 111 ms
92,104 KB
testcase_88 AC 108 ms
91,464 KB
testcase_89 AC 108 ms
91,592 KB
testcase_90 AC 109 ms
91,848 KB
testcase_91 AC 111 ms
91,208 KB
testcase_92 AC 458 ms
102,456 KB
testcase_93 AC 429 ms
100,356 KB
testcase_94 AC 421 ms
100,536 KB
testcase_95 AC 527 ms
103,708 KB
testcase_96 AC 533 ms
104,004 KB
testcase_97 AC 497 ms
102,712 KB
testcase_98 AC 507 ms
103,604 KB
testcase_99 AC 502 ms
103,636 KB
testcase_100 AC 421 ms
101,412 KB
testcase_101 AC 498 ms
103,104 KB
evil_1_rnd_1.txt AC 935 ms
117,416 KB
evil_1_rnd_2.txt AC 953 ms
117,280 KB
evil_2_big_1.txt AC 1,165 ms
124,312 KB
evil_2_big_2.txt AC 1,174 ms
124,944 KB
evil_2_big_3.txt AC 1,186 ms
124,548 KB
evil_3_sorted_1.txt AC 695 ms
105,620 KB
evil_4_sorted_rev_1.txt RE -
evil_4_sorted_rev_2.txt RE -
evil_400_sorted.txt AC 1,130 ms
116,372 KB
evil_400_sorted_rev.txt RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

res = ask(R)
if res == -1:
    exit()
if res == 1:
    ask(R, "!")
else:
    ask(L, "!")
0