結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | mkawa2 |
提出日時 | 2022-07-06 11:06:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,264 ms / 2,000 ms |
コード長 | 1,781 bytes |
コンパイル時間 | 633 ms |
コンパイル使用メモリ | 86,688 KB |
実行使用メモリ | 256,388 KB |
最終ジャッジ日時 | 2023-08-23 07:28:01 |
合計ジャッジ時間 | 27,936 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,075 ms
252,460 KB |
testcase_01 | AC | 696 ms
218,520 KB |
testcase_02 | AC | 829 ms
218,424 KB |
testcase_03 | AC | 237 ms
125,540 KB |
testcase_04 | AC | 366 ms
157,808 KB |
testcase_05 | AC | 68 ms
71,372 KB |
testcase_06 | AC | 68 ms
71,148 KB |
testcase_07 | AC | 385 ms
134,880 KB |
testcase_08 | AC | 326 ms
120,576 KB |
testcase_09 | AC | 651 ms
181,672 KB |
testcase_10 | AC | 721 ms
228,068 KB |
testcase_11 | AC | 689 ms
217,376 KB |
testcase_12 | AC | 644 ms
228,796 KB |
testcase_13 | AC | 787 ms
239,800 KB |
testcase_14 | AC | 803 ms
250,004 KB |
testcase_15 | AC | 747 ms
233,192 KB |
testcase_16 | AC | 763 ms
234,188 KB |
testcase_17 | AC | 777 ms
238,052 KB |
testcase_18 | AC | 88 ms
76,536 KB |
testcase_19 | AC | 89 ms
76,532 KB |
testcase_20 | AC | 89 ms
76,536 KB |
testcase_21 | AC | 88 ms
76,932 KB |
testcase_22 | AC | 732 ms
230,400 KB |
testcase_23 | AC | 575 ms
176,184 KB |
testcase_24 | AC | 770 ms
237,088 KB |
testcase_25 | AC | 703 ms
216,120 KB |
testcase_26 | AC | 732 ms
228,248 KB |
testcase_27 | AC | 69 ms
71,348 KB |
testcase_28 | AC | 68 ms
70,984 KB |
testcase_29 | AC | 69 ms
71,276 KB |
testcase_30 | AC | 69 ms
71,116 KB |
testcase_31 | AC | 81 ms
76,256 KB |
testcase_32 | AC | 81 ms
76,280 KB |
testcase_33 | AC | 69 ms
71,164 KB |
testcase_34 | AC | 80 ms
76,208 KB |
testcase_35 | AC | 68 ms
71,416 KB |
testcase_36 | AC | 68 ms
70,988 KB |
testcase_37 | AC | 68 ms
71,420 KB |
testcase_38 | AC | 1,264 ms
255,816 KB |
testcase_39 | AC | 851 ms
255,772 KB |
testcase_40 | AC | 572 ms
177,652 KB |
testcase_41 | AC | 893 ms
256,388 KB |
testcase_42 | AC | 896 ms
256,104 KB |
testcase_43 | AC | 885 ms
256,024 KB |
testcase_44 | AC | 917 ms
255,984 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = (1 << 63)-1 inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 class SparseTable: def __init__(self, op, e, aa): self.op = op w = len(aa) h = w.bit_length() table = [aa]+[[e() for _ in range(w)] for _ in range(h-1)] tablei1 = table[0] for i in range(1, h): tablei = table[i] for j in range(w-(1 << i)+1): rj = j+(1 << (i-1)) tablei[j] = op(tablei1[j], tablei1[rj]) tablei1 = tablei self.table = table # [l,r)の取得 def prod(self, l, r): i = (r-l).bit_length()-1 tablei = self.table[i] return self.op(tablei[l], tablei[r-(1 << i)]) from math import gcd def binary_search(l, r, ok, minimize): if minimize: l -= 1 else: r += 1 while l+1 < r: m = (l+r)//2 if ok(m) ^ minimize: l = m else: r = m if minimize: return r return l def ok(m): return sp.prod(m, i+1) > 1 n = II() aa = LI() sp = SparseTable(gcd, int, aa) ans = 0 for i in range(n): j = binary_search(0, i+1, ok, True) ans += j print(ans)