#936634 (PyPy3) No.2577 Simple Permutation Guess

• 問題: No.2577 Simple Permutation Guess
• ユーザー: Nikkuniku029
• 提出日時: 2023-12-05 18:31:24
• 言語: PyPy3 (7.3.15)
• 結果: RE
• 実行時間: -
• コード長: 5,692 bytes
• コンパイル時間: 527 ms
• コンパイル使用メモリ: 81,700 KB
• 実行使用メモリ: 96,472 KB
• 平均クエリ数: 251.95
• 最終ジャッジ日時: 2023-12-05 18:32:06
• 合計ジャッジ時間: 40,350 ms
• ジャッジサーバーID （参考情報）: judge11 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	104 ms; 83,864 KB
testcase_01	AC	578 ms; 95,164 KB
testcase_02	AC	291 ms; 95,264 KB
testcase_03	AC	102 ms; 85,944 KB
testcase_04	AC	324 ms; 95,360 KB
testcase_05	AC	387 ms; 95,008 KB
testcase_06	AC	588 ms; 95,232 KB
testcase_07	AC	623 ms; 95,144 KB
testcase_08	AC	575 ms; 95,544 KB
testcase_09	AC	615 ms; 95,408 KB
testcase_10	AC	619 ms; 95,924 KB
testcase_11	AC	100 ms; 85,944 KB
testcase_12	AC	103 ms; 83,860 KB
testcase_13	AC	130 ms; 94,032 KB
testcase_14	AC	111 ms; 88,656 KB
testcase_15	AC	98 ms; 85,944 KB
testcase_16	AC	90 ms; 83,864 KB
testcase_17	AC	93 ms; 83,860 KB
testcase_18	AC	99 ms; 83,864 KB
testcase_19	AC	90 ms; 83,860 KB
testcase_20	AC	104 ms; 83,860 KB
testcase_21	AC	92 ms; 83,860 KB
testcase_22	AC	97 ms; 83,852 KB
testcase_23	AC	91 ms; 83,856 KB
testcase_24	RE	-
testcase_25	AC	90 ms; 83,856 KB
testcase_26	AC	96 ms; 83,852 KB
testcase_27	AC	93 ms; 83,852 KB
testcase_28	AC	97 ms; 83,852 KB
testcase_29	AC	106 ms; 83,856 KB
testcase_30	AC	94 ms; 83,852 KB
testcase_31	AC	96 ms; 83,864 KB
testcase_32	AC	105 ms; 83,860 KB
testcase_33	AC	109 ms; 83,860 KB
testcase_34	AC	105 ms; 83,860 KB
testcase_35	AC	106 ms; 83,864 KB
testcase_36	AC	109 ms; 83,860 KB
testcase_37	AC	112 ms; 83,852 KB
testcase_38	AC	109 ms; 83,856 KB
testcase_39	AC	108 ms; 83,856 KB
testcase_40	AC	105 ms; 83,852 KB
testcase_41	AC	143 ms; 83,852 KB
testcase_42	AC	104 ms; 83,852 KB
testcase_43	AC	105 ms; 83,856 KB
testcase_44	AC	106 ms; 83,856 KB
testcase_45	AC	109 ms; 83,852 KB
testcase_46	AC	140 ms; 83,852 KB
testcase_47	AC	110 ms; 83,852 KB
testcase_48	AC	128 ms; 83,852 KB
testcase_49	AC	164 ms; 83,852 KB
testcase_50	AC	103 ms; 83,852 KB
testcase_51	AC	109 ms; 83,852 KB
testcase_52	AC	113 ms; 83,856 KB
testcase_53	AC	109 ms; 83,856 KB
testcase_54	AC	95 ms; 83,852 KB
testcase_55	AC	94 ms; 83,856 KB
testcase_56	AC	98 ms; 83,852 KB
testcase_57	AC	96 ms; 83,852 KB
testcase_58	AC	104 ms; 83,852 KB
testcase_59	AC	92 ms; 83,856 KB
testcase_60	AC	90 ms; 83,852 KB
testcase_61	AC	92 ms; 83,856 KB
testcase_62	AC	92 ms; 83,852 KB
testcase_63	AC	91 ms; 83,852 KB
testcase_64	AC	91 ms; 83,852 KB
testcase_65	AC	92 ms; 83,852 KB
testcase_66	AC	90 ms; 83,856 KB
testcase_67	AC	105 ms; 83,856 KB
testcase_68	AC	95 ms; 83,852 KB
testcase_69	AC	92 ms; 83,852 KB
testcase_70	AC	94 ms; 83,852 KB
testcase_71	AC	93 ms; 83,852 KB
testcase_72	AC	90 ms; 83,852 KB
testcase_73	AC	91 ms; 83,860 KB
testcase_74	AC	128 ms; 94,028 KB
testcase_75	AC	142 ms; 94,032 KB
testcase_76	AC	128 ms; 93,908 KB
testcase_77	AC	142 ms; 94,036 KB
testcase_78	AC	132 ms; 94,032 KB
testcase_79	AC	135 ms; 93,904 KB
testcase_80	AC	134 ms; 93,904 KB
testcase_81	AC	141 ms; 93,904 KB
testcase_82	AC	145 ms; 93,904 KB
testcase_83	AC	130 ms; 93,904 KB
testcase_84	AC	132 ms; 93,904 KB
testcase_85	AC	135 ms; 93,904 KB
testcase_86	AC	138 ms; 94,032 KB
testcase_87	AC	134 ms; 93,904 KB
testcase_88	AC	135 ms; 94,032 KB
testcase_89	AC	153 ms; 93,904 KB
testcase_90	AC	133 ms; 93,904 KB
testcase_91	AC	135 ms; 93,904 KB
testcase_92	AC	531 ms; 95,524 KB
testcase_93	AC	522 ms; 95,836 KB
testcase_94	AC	438 ms; 95,016 KB
testcase_95	AC	578 ms; 95,180 KB
testcase_96	AC	572 ms; 96,472 KB
testcase_97	AC	584 ms; 95,736 KB
testcase_98	AC	522 ms; 95,500 KB
testcase_99	AC	559 ms; 95,488 KB
testcase_100	AC	479 ms; 95,256 KB
testcase_101	AC	533 ms; 95,912 KB
evil_1_rnd_1.txt	AC	983 ms; 96,472 KB
evil_1_rnd_2.txt	AC	988 ms; 95,864 KB
evil_2_big_1.txt	AC	1,167 ms; 96,056 KB
evil_2_big_2.txt	AC	1,169 ms; 96,868 KB
evil_2_big_3.txt	AC	1,148 ms; 96,240 KB
evil_3_sorted_1.txt	AC	625 ms; 95,636 KB
evil_4_sorted_rev_1.txt	AC	639 ms; 96,148 KB
evil_4_sorted_rev_2.txt	AC	845 ms; 95,592 KB
evil_400_sorted.txt	AC	957 ms; 95,848 KB
evil_400_sorted_rev.txt	AC	1,142 ms; 96,360 KB

ソースコード

# 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())
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)