結果

問題 No.2719 Equal Inner Products in Permutation
ユーザー 👑 rin204
提出日時 2024-04-07 12:11:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 255 ms / 2,000 ms
コード長 1,171 bytes
コンパイル時間 233 ms
コンパイル使用メモリ 82,172 KB
実行使用メモリ 139,904 KB
最終ジャッジ日時 2024-10-01 04:26:22
合計ジャッジ時間 8,559 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import itertools
def f(n, flg):
for P in itertools.permutations(range(1, 3 * n + 1)):
if P[0] != 1:
break
t1 = 0
t2 = 0
for i in range(n):
t1 += P[i] * P[i + n]
t2 += P[i + n] * P[i + 2 * n]
if t1 == t2:
if not flg:
return P
add = 3 * n
Q = [p + add for p in P]
t1 = 0
t2 = 0
for i in range(n):
t1 += Q[i] * Q[i + n]
t2 += Q[i + n] * Q[i + 2 * n]
if t1 == t2:
return P
n = int(input())
if n == 1:
print(-1)
exit()
m = n % 3
if m < 2:
m += 3
A = list(f(m, False))
B = list(f(3, True))
L = []
M = []
R = []
for i in range(m):
L.append(A[i])
M.append(A[i + m])
R.append(A[i + 2 * m])
for i in range((n - m) // 3):
add = 3 * m + 9 * i
for t in range(3):
L.append(B[t] + add)
M.append(B[t + 3] + add)
R.append(B[t + 6] + add)
A = L + M + R
print(*A)
assert len(A) == 3 * n
t1 = 0
t2 = 0
for i in range(n):
t1 += A[i] * A[i + n]
t2 += A[i + n] * A[i + 2 * n]
assert t1 == t2
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0