結果

問題 No.1306 Exactly 2 Digits
ユーザー tamatotamato
提出日時 2020-12-31 00:59:21
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,964 bytes
コンパイル時間 384 ms
コンパイル使用メモリ 82,444 KB
実行使用メモリ 96,416 KB
平均クエリ数 1514.36
最終ジャッジ日時 2024-07-17 10:24:18
合計ジャッジ時間 43,491 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
70,212 KB
testcase_01 AC 58 ms
69,684 KB
testcase_02 AC 58 ms
68,944 KB
testcase_03 AC 58 ms
71,092 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 RE -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 59 ms
70,620 KB
testcase_13 AC 59 ms
70,368 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 60 ms
69,856 KB
testcase_17 AC 60 ms
69,800 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 62 ms
70,728 KB
testcase_25 RE -
testcase_26 RE -
testcase_27 WA -
testcase_28 RE -
testcase_29 RE -
testcase_30 RE -
testcase_31 RE -
testcase_32 AC 61 ms
69,684 KB
testcase_33 RE -
testcase_34 WA -
testcase_35 RE -
testcase_36 RE -
testcase_37 RE -
testcase_38 AC 64 ms
70,556 KB
testcase_39 AC 64 ms
70,896 KB
testcase_40 RE -
testcase_41 WA -
testcase_42 RE -
testcase_43 RE -
testcase_44 AC 67 ms
71,988 KB
testcase_45 WA -
testcase_46 WA -
testcase_47 RE -
testcase_48 RE -
testcase_49 RE -
testcase_50 RE -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 RE -
testcase_55 RE -
testcase_56 RE -
testcase_57 RE -
testcase_58 RE -
testcase_59 RE -
testcase_60 RE -
testcase_61 WA -
testcase_62 RE -
testcase_63 RE -
testcase_64 RE -
testcase_65 WA -
testcase_66 RE -
testcase_67 RE -
testcase_68 RE -
testcase_69 RE -
testcase_70 RE -
testcase_71 RE -
testcase_72 RE -
testcase_73 RE -
testcase_74 RE -
testcase_75 RE -
testcase_76 RE -
testcase_77 RE -
testcase_78 WA -
testcase_79 WA -
testcase_80 RE -
testcase_81 RE -
testcase_82 RE -
testcase_83 RE -
testcase_84 RE -
testcase_85 RE -
testcase_86 RE -
testcase_87 RE -
testcase_88 WA -
testcase_89 RE -
testcase_90 RE -
testcase_91 RE -
testcase_92 RE -
testcase_93 WA -
testcase_94 RE -
testcase_95 RE -
testcase_96 RE -
testcase_97 RE -
testcase_98 RE -
testcase_99 RE -
testcase_100 RE -
testcase_101 RE -
testcase_102 RE -
testcase_103 RE -
testcase_104 RE -
testcase_105 RE -
testcase_106 RE -
testcase_107 RE -
testcase_108 WA -
testcase_109 RE -
testcase_110 RE -
testcase_111 WA -
testcase_112 RE -
testcase_113 WA -
testcase_114 WA -
testcase_115 RE -
testcase_116 WA -
testcase_117 RE -
testcase_118 RE -
testcase_119 RE -
testcase_120 RE -
testcase_121 RE -
testcase_122 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline


    def ask(i, j):
        print("?", i, j)
        sys.stdout.flush()
        p, q = map(int, input().split())
        return p, q


    N = int(input())
    NN = (N**2 - N) // 2

    """
    A = list(range(N, N**2))
    #A = A[NN:] + A[:NN]
    A.reverse()
    cnt = [0]

    def ask(i, j):
        cnt[0] += 1
        ai, aj = A[i-1], A[j-1]
        p = ai // N - aj // N
        q = ai % N - aj % N
        if p > q:
            p, q = q, p
        return p, q
    """

    if N == 2:
        p, q = ask(1, 2)
        if p == -1:
            print("!", 2, 3)
            sys.stdout.flush()
        else:
            print("!", 3, 2)
            sys.stdout.flush()
        exit()

    info = []
    S = []
    for j in range(2, N**2 - N + 1):
        p, q = ask(1, j)
        info.append((p, q))
        S.append(p+q)

    s_min = min(S)
    s_max = max(S)
    ans = [-1] * (N**2 - N)
    for j, s in enumerate(S):
        if s == s_min:
            j_NN = j+1
        if s == s_max:
            j_10 = j+1

    if s_min > 0:
        j_NN = 0
        K = N**2 - 1
        x, y = N-1, N-1
        ans[0] = N**2 - 1
    elif s_max < 0:
        j_10 = 0
        K = N
        x, y = 1, 0
        ans[0] = N
    else:
        p, q = info[j_10]
        a, b = p+1, q
        if 1 <= a < N and 0 <= b < N:
            pp = a - (N-1)
            qq = b - (N-1)
            if pp > qq:
                pp, qq = qq, pp
            if pp == info[j_NN][0] and qq == info[j_NN][1]:
                x, y = a, b
                K = x * N + y
                ans[0] = K
            else:
                x, y = q+1, p
                K = x * N + y
                ans[0] = K
        else:
            x, y = q + 1, p
            K = x * N + y
            ans[0] = K

    j_ask = j_10
    x_ask, y_ask = 1, 0
    if x - y == 1:
        j_ask = j_NN
        x_ask, y_ask = N-1, N-1

    seen = {}
    for j in range(len(info)):
        if ans[j+1] != -1:
            continue
        p, q = info[j]
        if p*N + q in seen:
            ans[j+1] = seen[p*N + q]
            continue

        a, b = x - p, y - q
        c, d = x - q, y - p
        cand = []
        if 1 <= a < N and 0 <= b < N:
            cand.append((a, b))
        if 1 <= c < N and 0 <= d < N:
            cand.append((c, d))
        if len(cand) == 1:
            ans[j+1] = cand[0][0] * N + cand[0][1]
        else:
            p_new, q_new = ask(j+2, j_ask+1)
            pp, qq = a - x_ask, b - y_ask
            if pp > qq:
                pp, qq = qq, pp
            if pp == p_new and qq == q_new:
                ans[j+1] = a*N + b
                seen[p*N + q] = c*N + d
            else:
                ans[j+1] = c*N + d
                seen[p*N + q] = a*N + b
    ans = ["!"] + ans
    print(*ans)
    sys.stdout.flush()
    #print(cnt[0], NN * 3)
    exit()


if __name__ == '__main__':
    main()
0