結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | rlangevin |
提出日時 | 2024-01-15 12:05:50 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,133 ms / 2,000 ms |
コード長 | 3,567 bytes |
コンパイル時間 | 175 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 200,276 KB |
最終ジャッジ日時 | 2024-09-28 02:14:45 |
合計ジャッジ時間 | 21,563 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,133 ms
196,660 KB |
testcase_01 | AC | 307 ms
150,224 KB |
testcase_02 | AC | 584 ms
168,412 KB |
testcase_03 | AC | 114 ms
104,832 KB |
testcase_04 | AC | 151 ms
129,792 KB |
testcase_05 | AC | 38 ms
52,608 KB |
testcase_06 | AC | 40 ms
52,736 KB |
testcase_07 | AC | 178 ms
106,144 KB |
testcase_08 | AC | 148 ms
108,416 KB |
testcase_09 | AC | 476 ms
181,392 KB |
testcase_10 | AC | 429 ms
170,528 KB |
testcase_11 | AC | 466 ms
182,028 KB |
testcase_12 | AC | 450 ms
170,956 KB |
testcase_13 | AC | 647 ms
187,316 KB |
testcase_14 | AC | 706 ms
195,620 KB |
testcase_15 | AC | 634 ms
181,832 KB |
testcase_16 | AC | 619 ms
183,832 KB |
testcase_17 | AC | 741 ms
185,388 KB |
testcase_18 | AC | 58 ms
66,944 KB |
testcase_19 | AC | 65 ms
70,656 KB |
testcase_20 | AC | 73 ms
72,320 KB |
testcase_21 | AC | 70 ms
73,600 KB |
testcase_22 | AC | 634 ms
181,800 KB |
testcase_23 | AC | 457 ms
146,816 KB |
testcase_24 | AC | 648 ms
184,628 KB |
testcase_25 | AC | 681 ms
169,744 KB |
testcase_26 | AC | 624 ms
180,524 KB |
testcase_27 | AC | 40 ms
52,736 KB |
testcase_28 | AC | 40 ms
52,608 KB |
testcase_29 | AC | 39 ms
52,992 KB |
testcase_30 | AC | 37 ms
53,120 KB |
testcase_31 | AC | 39 ms
53,248 KB |
testcase_32 | AC | 39 ms
54,016 KB |
testcase_33 | AC | 36 ms
52,712 KB |
testcase_34 | AC | 37 ms
53,504 KB |
testcase_35 | AC | 37 ms
52,992 KB |
testcase_36 | AC | 36 ms
52,736 KB |
testcase_37 | AC | 38 ms
52,608 KB |
testcase_38 | AC | 738 ms
199,768 KB |
testcase_39 | AC | 884 ms
200,128 KB |
testcase_40 | AC | 442 ms
147,072 KB |
testcase_41 | AC | 785 ms
200,092 KB |
testcase_42 | AC | 798 ms
199,904 KB |
testcase_43 | AC | 867 ms
199,884 KB |
testcase_44 | AC | 862 ms
200,276 KB |
ソースコード
class SegmentTree: def __init__(self, n, identity_e, combine_f, ): self._n = n self._size = 1 while self._size < self._n: self._size <<= 1 self._identity_e = identity_e self._combine_f = combine_f self._node = [self._identity_e] * (2 * self._size) def build(self, array): assert len(array) == self._n for index, value in enumerate(array, start=self._size): self._node[index] = value for index in range(self._size - 1, 0, -1): self._node[index] = self._combine_f( self._node[index << 1 | 0], self._node[index << 1 | 1] ) def update(self, index, value): i = self._size + index self._node[i] = value while i > 1: i >>= 1 self._node[i] = self._combine_f( self._node[i << 1 | 0], self._node[i << 1 | 1] ) def fold(self, L, R): L += self._size R += self._size value_L = self._identity_e value_R = self._identity_e while L < R: if L & 1: value_L = self._combine_f(value_L, self._node[L]) L += 1 if R & 1: R -= 1 value_R = self._combine_f(self._node[R], value_R) L >>= 1 R >>= 1 return self._combine_f(value_L, value_R) def get(self, p): return self._node[p + self._size] def max_right(self, l, f): assert 0 <= l <= self._n assert f(self._identity_e) if l == self._n: return self._n l += self._size sm = self._identity_e while True: while l % 2 == 0: l >>= 1 if not f(self._combine_f(sm, self._node[l])): while l < self._size: l <<= 1 if f(self._combine_f(sm, self._node[l])): sm = self._combine_f(sm, self._node[l]) l += 1 return l - self._size sm = self._combine_f(sm, self._node[l]) l += 1 if l & -l == l: break return self._n def min_left(self, r, f): assert 0 <= r <= self._n assert f(self._identity_e) if r == 0: return 0 r += self._size sm = self._identity_e while True: r -= 1 while r > 1 and r % 2: r >>= 1 if not f(self._combine_f(self._node[r], sm)): while r < self._size: r = 2 * r + 1 if f(self._combine_f(self._node[r], sm)): sm = self._combine_f(self._node[r], sm) r -= 1 return r + 1 - self._size sm = self._combine_f(self._node[r], sm) if r & -r == r: break return 0 from math import gcd N = int(input()) A = list(map(int, input().split())) T = SegmentTree(N, 0, gcd) T.build(A) ans = N * (N + 1) // 2 def f(x): return x != 1 for i in range(N): ans -= T.max_right(i, f) - i # if T.fold(i, N) != 1: # ans -= N - i # continue # yes = i # no = N # while no - yes != 1: # mid = (yes + no) // 2 # if T.fold(i, mid) != 1: # yes = mid # else: # no = mid # ans -= yes - i print(ans)