結果
問題 | No.2496 LCM between Permutations |
ユーザー | minimum |
提出日時 | 2023-10-06 22:22:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 278 ms / 2,000 ms |
コード長 | 2,584 bytes |
コンパイル時間 | 308 ms |
コンパイル使用メモリ | 87,304 KB |
実行使用メモリ | 94,160 KB |
平均クエリ数 | 953.86 |
最終ジャッジ日時 | 2023-10-06 22:22:24 |
合計ジャッジ時間 | 6,754 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 98 ms
87,260 KB |
testcase_01 | AC | 93 ms
87,216 KB |
testcase_02 | AC | 93 ms
87,824 KB |
testcase_03 | AC | 94 ms
87,220 KB |
testcase_04 | AC | 93 ms
87,052 KB |
testcase_05 | AC | 93 ms
87,572 KB |
testcase_06 | AC | 92 ms
87,332 KB |
testcase_07 | AC | 92 ms
87,348 KB |
testcase_08 | AC | 95 ms
87,492 KB |
testcase_09 | AC | 101 ms
87,636 KB |
testcase_10 | AC | 94 ms
87,688 KB |
testcase_11 | AC | 94 ms
87,400 KB |
testcase_12 | AC | 93 ms
87,184 KB |
testcase_13 | AC | 94 ms
87,208 KB |
testcase_14 | AC | 94 ms
86,764 KB |
testcase_15 | AC | 106 ms
91,216 KB |
testcase_16 | AC | 112 ms
91,700 KB |
testcase_17 | AC | 119 ms
92,596 KB |
testcase_18 | AC | 242 ms
93,396 KB |
testcase_19 | AC | 193 ms
93,308 KB |
testcase_20 | AC | 233 ms
93,308 KB |
testcase_21 | AC | 216 ms
93,740 KB |
testcase_22 | AC | 210 ms
93,640 KB |
testcase_23 | AC | 254 ms
93,624 KB |
testcase_24 | AC | 225 ms
93,632 KB |
testcase_25 | AC | 278 ms
94,064 KB |
testcase_26 | AC | 262 ms
93,816 KB |
testcase_27 | AC | 270 ms
94,160 KB |
testcase_28 | AC | 259 ms
93,840 KB |
ソースコード
def primelist(N): pr = [] lpf = [0] * (N + 1) for d in range(2, N + 1): if lpf[d] == 0: lpf[d] = d pr.append(d) for p in pr: if p * d > N or p > lpf[d]: break lpf[p * d] = p return pr N = int(input()) if N == 1: print('!', 1, 1, flush=True) exit() pr = primelist(N) P = max(pr) ls = [] res = [-1] * N for j in range(N): print('?', 1, j + 1, flush=True) x = int(input()) res[j] = x if x % P == 0: ls.append(j) resa, resb = [-1] * N, [-1] * N ansa, ansb = [-1] * N, [-1] * N if len(ls) == 1: # B[j0] = P j0 = ls[0] for i in range(N): print('?', i + 1, j0 + 1, flush=True) x = int(input()) resa[i] = x # resa に P が 2 箇所 i0_list = [] for i in range(N): if resa[i] == P: i0_list.append(i) i0 = i0_list[0] for j in range(N): print('?', i0 + 1, j + 1, flush=True) x = int(input()) resb[j] = x if min(resb) == 1: # A[i0] = 1 ansa[i0] = 1 ansa[i0_list[1]] = P ansb = resb for i in range(N): if ansa[i] == -1: ansa[i] = resa[i] // P else: # A[i0] = P ansa[i0] = P ansa[i0_list[1]] = 1 for j in range(N): if j == j0: ansb[j] = P else: ansb[j] = resb[j] // P for i in range(N): if ansa[i] == -1: ansa[i] = resa[i] // P print('!', *ansa, *ansb, flush=True) elif len(ls) == N: # A[i0] = P i0 = 0 for j in range(N): print('?', i0 + 1, j + 1, flush=True) x = int(input()) resb[j] = x # resb に P が 2 箇所 j0_list = [] for j in range(N): if resb[j] == P: j0_list.append(j) j0 = j0_list[0] for i in range(N): print('?', i + 1, j0 + 1, flush=True) x = int(input()) resa[i] = x if min(resa) == 1: # B[j0] = 1 ansb[j0] = 1 ansb[j0_list[1]] = P ansa = resa for j in range(N): if ansb[j] == -1: ansb[j] = resb[j] // P else: # B[j0] = P ansb[j0] = P ansb[j0_list[1]] = 1 for i in range(N): if i == i0: ansa[i] = P else: ansa[i] = resa[i] // P for i in range(N): if ansb[i] == -1: ansb[i] = resb[i] // P print('!', *ansa, *ansb, flush=True) else: exit()