#588522 (PyPy3) No.1306 Exactly 2 Digits

• 問題: No.1306 Exactly 2 Digits
• ユーザー: chineristAC
• 提出日時: 2020-12-03 02:03:16
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 400 ms / 2,000 ms
• コード長: 1,934 bytes
• コンパイル時間: 248 ms
• コンパイル使用メモリ: 82,396 KB
• 実行使用メモリ: 95,040 KB
• 平均クエリ数: 1237.76
• 最終ジャッジ日時: 2024-07-17 08:13:21
• 合計ジャッジ時間: 29,129 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 123

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
import sys
def query(i,j):
    print("?",i+1,j+1)
    sys.stdout.flush()
    p,q = map(int,input().split())
    return (p,q)
N = int(input())
if N==2:
    p,q = query(1,0)
    if (p,q)==(0,1):
        print("!",2,3)
    else:
        print("!",3,2)
    exit()
answer = [-1 for i in range(N**2-N)]
mod = 998244353
B = [1]
for i in [0]*100:
    B.append((B[-1]*1001)%mod)
S = [0 for i in range(N**2-N)]
for i in range(N,N**2):
    for j in range(N,N**2):
        p = (j//N)-(i//N)
        q = (j%N)-(i%N)
        if p>q:
            p,q = q,p
        S[i-N] += B[p+N] + B[q+N]
        S[i-N] %= mod
all_query = [-1 for i in range(N**2-N)]
s = 0
for i in range(N**2-N):
    p,q = query(i,0)
    all_query[i] = (p,q)
    s += B[p+N] + B[q+N]
    s %= mod
for i in range(N**2-N):
    if s==S[i]:
        answer[0] = i + N
        break
dic = {}
#print(answer[0])
for i in range(N,N**2):
    j = answer[0]
    p = (i//N)-(j//N)
    q = (i%N)-(j%N)
    if p>q:
        p,q = q,p
    if (p,q) not in dic:
        dic[p,q] = []
    dic[p,q].append(i)
#print(dic)
base = -1
base_idx = -1
i,j = 2*N-1,answer[0]
p = (i//N)-(j//N)
q = (i%N)-(j%N)
if p>q:
    p,q = q,p
if len(dic[p,q])==1:
    base = 2*N-1
    for i in range(N**2-N):
        if (p,q)==all_query[i]:
            base_idx = i
            break
else:
    i,j = N**2-N,answer[0]
    p = (i//N)-(j//N)
    q = (i%N)-(j%N)
    if p>q:
        p,q = q,p
    base = N**2-N
    for i in range(N**2-N):
        if (p,q)==all_query[i]:
            base_idx = i
            break
#print(base,base_idx)
base_dic = {}
j = base
for i in range(N,N**2):
    p = (i//N)-(j//N)
    q = (i%N)-(j%N)
    if p>q:
        p,q = q,p
    base_dic[p,q] = i
for i in range(N**2-N):
    p,q = all_query[i]
    if len(dic[p,q])==1:
        answer[i] = dic[p,q][0]
    else:
        P,Q = query(i,base_idx)
        answer[i] = base_dic[P,Q]
        dic[p,q].remove(answer[i])
print("!",*answer)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX