結果
問題 | No.2519 Coins in Array |
ユーザー | rlangevin |
提出日時 | 2023-10-27 23:03:52 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,749 bytes |
コンパイル時間 | 359 ms |
コンパイル使用メモリ | 81,856 KB |
実行使用メモリ | 106,244 KB |
最終ジャッジ日時 | 2023-10-27 23:04:00 |
合計ジャッジ時間 | 6,795 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
55,812 KB |
testcase_01 | AC | 38 ms
55,812 KB |
testcase_02 | AC | 35 ms
55,748 KB |
testcase_03 | AC | 35 ms
55,816 KB |
testcase_04 | AC | 38 ms
55,812 KB |
testcase_05 | AC | 35 ms
55,816 KB |
testcase_06 | AC | 36 ms
55,812 KB |
testcase_07 | WA | - |
testcase_08 | AC | 37 ms
55,812 KB |
testcase_09 | AC | 36 ms
55,816 KB |
testcase_10 | AC | 35 ms
55,816 KB |
testcase_11 | AC | 37 ms
55,816 KB |
testcase_12 | AC | 35 ms
55,816 KB |
testcase_13 | WA | - |
testcase_14 | AC | 37 ms
55,812 KB |
testcase_15 | AC | 39 ms
55,748 KB |
testcase_16 | WA | - |
testcase_17 | AC | 40 ms
55,812 KB |
testcase_18 | AC | 36 ms
55,816 KB |
testcase_19 | AC | 36 ms
55,812 KB |
testcase_20 | AC | 35 ms
55,812 KB |
testcase_21 | AC | 35 ms
55,812 KB |
testcase_22 | AC | 35 ms
55,812 KB |
testcase_23 | AC | 132 ms
106,232 KB |
testcase_24 | AC | 135 ms
105,880 KB |
testcase_25 | AC | 39 ms
55,812 KB |
testcase_26 | AC | 37 ms
55,812 KB |
testcase_27 | AC | 136 ms
106,244 KB |
testcase_28 | AC | 132 ms
106,244 KB |
testcase_29 | AC | 133 ms
106,244 KB |
testcase_30 | AC | 131 ms
102,336 KB |
testcase_31 | AC | 81 ms
78,900 KB |
testcase_32 | AC | 99 ms
89,732 KB |
testcase_33 | AC | 111 ms
96,520 KB |
testcase_34 | AC | 83 ms
84,972 KB |
testcase_35 | AC | 113 ms
94,088 KB |
testcase_36 | AC | 77 ms
82,584 KB |
testcase_37 | AC | 67 ms
77,860 KB |
testcase_38 | AC | 105 ms
91,600 KB |
testcase_39 | AC | 98 ms
83,760 KB |
testcase_40 | AC | 134 ms
103,980 KB |
ソースコード
from math import * from copy import * inf = 10 ** 18 def f(x, y): if gcd(x, y) != 1: return 0 v = (x - 1) * (y - 1) if v >= inf: return -1 return v N = int(input()) A = list(map(int, input().split())) if N == 2: print(f(A[0], A[1])) print(1, 2) elif N == 3: v = inf T = [(1, 2), (1, 2)], [(1, 3), (1, 2)] ans = [] for tt in T: D = deepcopy(A) for t in tt: temp = f(D[t[0] - 1], D[t[1] - 1]) D.pop(t[1] - 1) D.pop(t[0] - 1) if temp == -1: break D.append(temp) else: if D[0] < v: ans = tt v = D[0] print(v) for a, b in ans: print(a, b) else: def f1(A , ans=[]): ind1, ind2 = -1, -1 N = len(A) for i in range(N): if ind1 == -1: if A[i]%2 == 0: ind1 = i + 1 else: if A[i]%2 == 0: ind2 = i + 1 if ind2 != -1: print(0) for a, b in ans: print(a, b) print(ind1, ind2) for i in range(N - 1, 1, -1): print(1, i) exit() def f2(A): ind1, ind2 = -1, -1 N = len(A) for i in range(N): if ind1 == -1: if A[i]%2 == 1: ind1 = i + 1 else: if A[i]%2 == 1: ind2 = i + 1 v = f(A.pop(ind2 - 1), A.pop(ind1 - 1)) A.append(v) return (ind1, ind2), A f1(A) t, A = f2(A) ans = [t] f1(A, ans) t, A = f2(A) ans.append(t) f1(A, ans)