結果

問題 No.2577 Simple Permutation Guess
ユーザー Nikkuniku029Nikkuniku029
提出日時 2023-12-05 18:34:06
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 5,798 bytes
コンパイル時間 375 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 96,460 KB
平均クエリ数 251.96
最終ジャッジ日時 2023-12-05 18:34:42
合計ジャッジ時間 34,288 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 92 ms
83,860 KB
testcase_01 AC 486 ms
95,168 KB
testcase_02 AC 256 ms
95,144 KB
testcase_03 AC 89 ms
85,944 KB
testcase_04 AC 289 ms
95,476 KB
testcase_05 AC 315 ms
95,008 KB
testcase_06 AC 554 ms
95,228 KB
testcase_07 AC 551 ms
95,252 KB
testcase_08 AC 529 ms
95,648 KB
testcase_09 AC 540 ms
95,516 KB
testcase_10 AC 552 ms
96,032 KB
testcase_11 AC 86 ms
85,944 KB
testcase_12 AC 85 ms
83,860 KB
testcase_13 AC 123 ms
94,032 KB
testcase_14 AC 128 ms
88,784 KB
testcase_15 AC 89 ms
85,944 KB
testcase_16 AC 84 ms
83,860 KB
testcase_17 AC 84 ms
83,860 KB
testcase_18 AC 84 ms
83,860 KB
testcase_19 AC 86 ms
83,860 KB
testcase_20 AC 86 ms
83,860 KB
testcase_21 AC 86 ms
83,860 KB
testcase_22 AC 87 ms
83,852 KB
testcase_23 AC 87 ms
83,852 KB
testcase_24 RE -
testcase_25 AC 84 ms
83,852 KB
testcase_26 AC 84 ms
83,852 KB
testcase_27 AC 84 ms
83,852 KB
testcase_28 AC 85 ms
83,852 KB
testcase_29 AC 83 ms
83,852 KB
testcase_30 AC 86 ms
83,852 KB
testcase_31 AC 84 ms
83,860 KB
testcase_32 AC 84 ms
83,860 KB
testcase_33 AC 84 ms
83,860 KB
testcase_34 AC 83 ms
83,860 KB
testcase_35 AC 84 ms
83,860 KB
testcase_36 AC 84 ms
83,860 KB
testcase_37 AC 84 ms
83,852 KB
testcase_38 AC 95 ms
83,852 KB
testcase_39 AC 84 ms
83,852 KB
testcase_40 AC 84 ms
83,852 KB
testcase_41 AC 84 ms
83,852 KB
testcase_42 AC 85 ms
83,852 KB
testcase_43 AC 87 ms
83,852 KB
testcase_44 AC 84 ms
83,852 KB
testcase_45 AC 84 ms
83,852 KB
testcase_46 AC 86 ms
83,852 KB
testcase_47 AC 83 ms
83,852 KB
testcase_48 AC 84 ms
83,852 KB
testcase_49 AC 84 ms
83,852 KB
testcase_50 AC 87 ms
83,852 KB
testcase_51 AC 85 ms
83,852 KB
testcase_52 AC 82 ms
83,852 KB
testcase_53 AC 86 ms
83,852 KB
testcase_54 AC 86 ms
83,852 KB
testcase_55 AC 86 ms
83,852 KB
testcase_56 AC 83 ms
83,852 KB
testcase_57 AC 82 ms
83,852 KB
testcase_58 AC 83 ms
83,852 KB
testcase_59 AC 84 ms
83,852 KB
testcase_60 AC 84 ms
83,852 KB
testcase_61 AC 86 ms
83,852 KB
testcase_62 AC 87 ms
83,852 KB
testcase_63 AC 82 ms
83,852 KB
testcase_64 AC 83 ms
83,852 KB
testcase_65 AC 83 ms
83,852 KB
testcase_66 AC 84 ms
83,852 KB
testcase_67 AC 84 ms
83,852 KB
testcase_68 AC 85 ms
83,852 KB
testcase_69 AC 85 ms
83,852 KB
testcase_70 AC 84 ms
83,852 KB
testcase_71 AC 83 ms
83,852 KB
testcase_72 AC 87 ms
83,852 KB
testcase_73 AC 86 ms
83,860 KB
testcase_74 AC 119 ms
94,028 KB
testcase_75 AC 117 ms
93,904 KB
testcase_76 AC 118 ms
93,908 KB
testcase_77 AC 117 ms
94,028 KB
testcase_78 AC 116 ms
94,032 KB
testcase_79 AC 116 ms
93,904 KB
testcase_80 AC 122 ms
93,904 KB
testcase_81 AC 118 ms
93,904 KB
testcase_82 AC 124 ms
93,904 KB
testcase_83 AC 121 ms
93,904 KB
testcase_84 AC 118 ms
93,904 KB
testcase_85 AC 118 ms
93,904 KB
testcase_86 AC 125 ms
94,032 KB
testcase_87 AC 127 ms
93,904 KB
testcase_88 AC 121 ms
94,032 KB
testcase_89 AC 128 ms
93,904 KB
testcase_90 AC 120 ms
93,904 KB
testcase_91 AC 122 ms
93,904 KB
testcase_92 AC 488 ms
95,524 KB
testcase_93 AC 451 ms
95,796 KB
testcase_94 AC 407 ms
95,020 KB
testcase_95 AC 525 ms
95,324 KB
testcase_96 AC 528 ms
96,460 KB
testcase_97 AC 530 ms
95,528 KB
testcase_98 AC 492 ms
95,628 KB
testcase_99 AC 504 ms
95,356 KB
testcase_100 AC 480 ms
95,264 KB
testcase_101 AC 523 ms
96,036 KB
evil_1_rnd_1.txt AC 935 ms
96,464 KB
evil_1_rnd_2.txt AC 921 ms
95,852 KB
evil_2_big_1.txt AC 1,092 ms
96,052 KB
evil_2_big_2.txt AC 1,104 ms
97,004 KB
evil_2_big_3.txt AC 1,084 ms
96,136 KB
evil_3_sorted_1.txt AC 597 ms
95,620 KB
evil_4_sorted_rev_1.txt AC 596 ms
96,132 KB
evil_4_sorted_rev_2.txt AC 740 ms
95,464 KB
evil_400_sorted.txt AC 926 ms
95,720 KB
evil_400_sorted_rev.txt AC 1,091 ms
96,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional

T = TypeVar("T")


class SortedSet(Generic[T]):
    BUCKET_RATIO = 16
    SPLIT_RATIO = 24

    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
        a = list(a)
        n = self.size = len(a)
        if any(a[i] > a[i + 1] for i in range(n - 1)):
            a.sort()
        if any(a[i] >= a[i + 1] for i in range(n - 1)):
            a, b = [], a
            for x in b:
                if not a or a[-1] != x:
                    a.append(x)
        bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
        self.a = [
            a[n * i // bucket_size : n * (i + 1) // bucket_size]
            for i in range(bucket_size)
        ]

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i:
                yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i):
                yield j

    def __eq__(self, other) -> bool:
        return list(self) == list(other)

    def __len__(self) -> int:
        return self.size

    def __repr__(self) -> str:
        return "SortedSet" + str(self.a)

    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _position(self, x: T) -> Tuple[List[T], int, int]:
        "return the bucket, index of the bucket and position in which x should be. self must not be empty."
        for i, a in enumerate(self.a):
            if x <= a[-1]:
                break
        return (a, i, bisect_left(a, x))

    def __contains__(self, x: T) -> bool:
        if self.size == 0:
            return False
        a, _, i = self._position(x)
        return i != len(a) and a[i] == x

    def add(self, x: T) -> bool:
        "Add an element and return True if added. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return True
        a, b, i = self._position(x)
        if i != len(a) and a[i] == x:
            return False
        a.insert(i, x)
        self.size += 1
        if len(a) > len(self.a) * self.SPLIT_RATIO:
            mid = len(a) >> 1
            self.a[b : b + 1] = [a[:mid], a[mid:]]
        return True

    def _pop(self, a: List[T], b: int, i: int) -> T:
        ans = a.pop(i)
        self.size -= 1
        if not a:
            del self.a[b]
        return ans

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0:
            return False
        a, b, i = self._position(x)
        if i == len(a) or a[i] != x:
            return False
        self._pop(a, b, i)
        return True

    def lt(self, x: T) -> Optional[T]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Optional[T]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Optional[T]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Optional[T]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]

    def __getitem__(self, i: int) -> T:
        "Return the i-th element."
        if i < 0:
            for a in reversed(self.a):
                i += len(a)
                if i >= 0:
                    return a[i]
        else:
            for a in self.a:
                if i < len(a):
                    return a[i]
                i -= len(a)
        raise IndexError

    def pop(self, i: int = -1) -> T:
        "Pop and return the i-th element."
        if i < 0:
            for b, a in enumerate(reversed(self.a)):
                i += len(a)
                if i >= 0:
                    return self._pop(a, ~b, i)
        else:
            for b, a in enumerate(self.a):
                if i < len(a):
                    return self._pop(a, b, i)
                i -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans


N = int(input())
if N == 1:
    print("?", *[1], flush=True)
    ret = int(input())
    exit(print("!", *[1], flush=True))
ans = []
ok = set()
for i in range(N):
    s = SortedSet()
    for j in range(1, N + 1):
        if j in ok:
            continue
        s.add(j)
    l = 0
    r = len(s)
    while r - l > 1:
        mid = (l + r) // 2
        k = s[mid]
        Q = ans + [k]
        for m in range(1, N + 1):
            if m in s and m != k:
                Q.append(m)
        print("?", *Q, flush=True)
        ret = int(input())
        if ret == 1:
            l = mid
        else:
            r = mid
    ans.append(s[l])
    ok.add(s[l])
    s.discard(s[l])
print("!", *ans, flush=True)
0