結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | LyricalMaestro |
提出日時 | 2024-01-24 03:26:45 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,599 bytes |
コンパイル時間 | 638 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 336,856 KB |
最終ジャッジ日時 | 2024-01-24 03:27:37 |
合計ジャッジ時間 | 51,841 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,518 ms
301,908 KB |
testcase_01 | AC | 1,164 ms
278,944 KB |
testcase_02 | AC | 1,278 ms
306,004 KB |
testcase_03 | AC | 352 ms
160,540 KB |
testcase_04 | AC | 619 ms
242,684 KB |
testcase_05 | AC | 39 ms
53,460 KB |
testcase_06 | AC | 39 ms
53,460 KB |
testcase_07 | AC | 432 ms
186,440 KB |
testcase_08 | AC | 365 ms
158,680 KB |
testcase_09 | AC | 1,636 ms
274,572 KB |
testcase_10 | AC | 1,568 ms
334,928 KB |
testcase_11 | AC | 1,697 ms
278,344 KB |
testcase_12 | AC | 1,567 ms
336,856 KB |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | AC | 1,794 ms
282,424 KB |
testcase_16 | AC | 1,821 ms
283,876 KB |
testcase_17 | AC | 1,948 ms
288,936 KB |
testcase_18 | AC | 55 ms
66,264 KB |
testcase_19 | AC | 58 ms
68,448 KB |
testcase_20 | AC | 62 ms
70,488 KB |
testcase_21 | AC | 62 ms
70,496 KB |
testcase_22 | AC | 1,785 ms
280,224 KB |
testcase_23 | AC | 1,412 ms
264,180 KB |
testcase_24 | AC | 1,872 ms
286,728 KB |
testcase_25 | AC | 1,702 ms
269,400 KB |
testcase_26 | AC | 1,790 ms
276,484 KB |
testcase_27 | AC | 38 ms
53,460 KB |
testcase_28 | AC | 38 ms
53,460 KB |
testcase_29 | AC | 37 ms
53,460 KB |
testcase_30 | AC | 38 ms
53,460 KB |
testcase_31 | AC | 47 ms
62,000 KB |
testcase_32 | AC | 46 ms
62,000 KB |
testcase_33 | AC | 38 ms
53,460 KB |
testcase_34 | AC | 46 ms
62,000 KB |
testcase_35 | AC | 38 ms
53,460 KB |
testcase_36 | AC | 39 ms
53,460 KB |
testcase_37 | AC | 37 ms
53,460 KB |
testcase_38 | AC | 1,212 ms
303,124 KB |
testcase_39 | TLE | - |
testcase_40 | AC | 1,379 ms
264,680 KB |
testcase_41 | TLE | - |
testcase_42 | TLE | - |
testcase_43 | AC | 1,833 ms
303,248 KB |
testcase_44 | TLE | - |
ソースコード
## https://yukicoder.me/problems/no/1036 def calc_gcd(A, B): """ 正の整数A, Bの最大公約数を計算する """ a = max(A, B) b = min(A, B) while a % b > 0: c = a % b a = b b = c return b class SparseTable: def __init__(self, A): self.N = len(A) k = 0 while (1 << k) < self.N: k += 1 self.max_k = k self.table = [[] for _ in range(self.N)] for k in range(self.max_k + 1): for i in range(self.N): if k == 0: self.table[i].append(A[i]) else: if i + (1 << k) - 1 < self.N: if len(self.table[i]) < k: continue if len(self.table[i + (1 << (k - 1))]) < k: continue a = self.table[i][k - 1] b = self.table[i + (1 << (k - 1))][k - 1] self.table[i].append(calc_gcd(a, b)) def query(self, l, r): length = r - l + 1 if length == 1: return self.table[l][0] k = 0 while (1 << k) < length: k += 1 k -= 1 a = self.table[l][k] b = self.table[r - ((1 << k) - 1)][k] return calc_gcd(a, b) def main(): N = int(input()) A = list(map(int, input().split())) st = SparseTable(A) answer = 0 left = 0 right = 0 a = A[0] while left < N and a == 1: answer += N - left left += 1 right += 1 if left < N: a = A[left] else: a = 0 while left < N: while right < N - 1 and calc_gcd(a, A[right + 1]) > 1: a = calc_gcd(a, A[right + 1]) right += 1 if right < N - 1: answer += N - (right + 1) if left < right: left += 1 a = st.query(left, right) else: left += 1 right += 1 a = A[left] while left < N and a == 1: answer += N - left left += 1 right += 1 if left < N: a = A[left] else: a = 0 else: if left < right: left += 1 a = st.query(left, right) else: break print(answer) if __name__ == "__main__": main()