結果
問題 | No.1036 Make One With GCD 2 |
ユーザー |
![]() |
提出日時 | 2022-07-06 11:06:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,229 ms / 2,000 ms |
コード長 | 1,781 bytes |
コンパイル時間 | 315 ms |
コンパイル使用メモリ | 82,464 KB |
実行使用メモリ | 252,096 KB |
最終ジャッジ日時 | 2024-12-21 08:09:15 |
合計ジャッジ時間 | 23,429 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 41 |
ソースコード
import sys# sys.setrecursionlimit(200005)int1 = lambda x: int(x)-1pDB = 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)-1inf = (1 << 31)-1md = 10**9+7# md = 998244353class SparseTable:def __init__(self, op, e, aa):self.op = opw = 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 = tableiself.table = table# [l,r)の取得def prod(self, l, r):i = (r-l).bit_length()-1tablei = self.table[i]return self.op(tablei[l], tablei[r-(1 << i)])from math import gcddef binary_search(l, r, ok, minimize):if minimize: l -= 1else: r += 1while l+1 < r:m = (l+r)//2if ok(m) ^ minimize: l = melse: r = mif minimize: return rreturn ldef ok(m):return sp.prod(m, i+1) > 1n = II()aa = LI()sp = SparseTable(gcd, int, aa)ans = 0for i in range(n):j = binary_search(0, i+1, ok, True)ans += jprint(ans)