結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | tktk_snsn |
提出日時 | 2020-12-22 20:00:49 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,152 ms / 2,000 ms |
コード長 | 8,759 bytes |
コンパイル時間 | 1,307 ms |
コンパイル使用メモリ | 86,804 KB |
実行使用メモリ | 185,720 KB |
最終ジャッジ日時 | 2023-10-14 20:41:36 |
合計ジャッジ時間 | 23,173 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,152 ms
184,072 KB |
testcase_01 | AC | 303 ms
169,052 KB |
testcase_02 | AC | 571 ms
146,184 KB |
testcase_03 | AC | 132 ms
104,848 KB |
testcase_04 | AC | 165 ms
120,168 KB |
testcase_05 | AC | 65 ms
71,124 KB |
testcase_06 | AC | 66 ms
70,884 KB |
testcase_07 | AC | 187 ms
112,768 KB |
testcase_08 | AC | 166 ms
105,968 KB |
testcase_09 | AC | 470 ms
167,984 KB |
testcase_10 | AC | 469 ms
158,024 KB |
testcase_11 | AC | 487 ms
168,420 KB |
testcase_12 | AC | 473 ms
158,324 KB |
testcase_13 | AC | 670 ms
175,404 KB |
testcase_14 | AC | 698 ms
183,968 KB |
testcase_15 | AC | 651 ms
172,788 KB |
testcase_16 | AC | 645 ms
172,844 KB |
testcase_17 | AC | 651 ms
174,984 KB |
testcase_18 | AC | 83 ms
76,360 KB |
testcase_19 | AC | 93 ms
76,388 KB |
testcase_20 | AC | 95 ms
77,264 KB |
testcase_21 | AC | 97 ms
77,028 KB |
testcase_22 | AC | 642 ms
172,728 KB |
testcase_23 | AC | 503 ms
141,704 KB |
testcase_24 | AC | 664 ms
174,796 KB |
testcase_25 | AC | 615 ms
162,716 KB |
testcase_26 | AC | 641 ms
171,892 KB |
testcase_27 | AC | 67 ms
71,096 KB |
testcase_28 | AC | 69 ms
71,116 KB |
testcase_29 | AC | 69 ms
71,148 KB |
testcase_30 | AC | 67 ms
70,968 KB |
testcase_31 | AC | 68 ms
70,940 KB |
testcase_32 | AC | 68 ms
71,168 KB |
testcase_33 | AC | 66 ms
71,140 KB |
testcase_34 | AC | 70 ms
70,976 KB |
testcase_35 | AC | 68 ms
70,960 KB |
testcase_36 | AC | 66 ms
71,092 KB |
testcase_37 | AC | 67 ms
71,064 KB |
testcase_38 | AC | 758 ms
185,548 KB |
testcase_39 | AC | 885 ms
185,416 KB |
testcase_40 | AC | 494 ms
141,680 KB |
testcase_41 | AC | 791 ms
185,652 KB |
testcase_42 | AC | 776 ms
185,548 KB |
testcase_43 | AC | 854 ms
185,392 KB |
testcase_44 | AC | 891 ms
185,720 KB |
ソースコード
from math import gcd import sys input = sys.stdin.buffer.readline sys.setrecursionlimit(10 ** 7) class SegTree(object): def __init__(self, N, op_data, u_data): self._n = N self.log = (N-1).bit_length() self.size = 1 << self.log self.op = op_data self.e = u_data self.data = [u_data] * (2 * self.size) # self.len = [1] * (2 * self.size) def _update(self, i): self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1]) def initialize(self, arr): """ segtreeをarrで初期化する。len(arr) == Nにすること """ for i, a in enumerate(arr, self.size): self.data[i] = a for i in reversed(range(1, self.size)): self._update(i) # self.len[i] = self.len[i << 1] + self.len[i << 1 | 1] def update(self, p, x): """ data[p] = x とする (0-indexed)""" p += self.size self.data[p] = x for i in range(1, self.log + 1): self._update(p >> i) def get(self, p): """ data[p]を返す """ return self.data[p + self.size] def prod(self, l, r): """ op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed) """ sml = self.e smr = self.e l += self.size r += self.size while l < r: if l & 1: sml = self.op(sml, self.data[l]) l += 1 if r & 1: r -= 1 smr = self.op(self.data[r], smr) l >>= 1 r >>= 1 return self.op(sml, smr) def all_prod(self): """ op(data[0], data[1], ... data[N-1])を返す """ return self.data[1] def max_right(self, l, func): """ func(l, l+1, ..., r-1) = True, func(l, l+1, ..., r-1, r) = Falseとなる r を返す """ if l == self._n: return self._n l += self.size sm = self.e while True: while l % 2 == 0: l >>= 1 if not func(self.op(sm, self.data[l])): while l < self.size: l <<= 1 if func(self.op(sm, self.data[l])): sm = self.op(sm, self.data[l]) l += 1 return l - self.size sm = self.op(sm, self.data[l]) l += 1 if (l & -l) == l: break return self._n def min_left(self, r, func): """ func( l, l+1, ..., r-1) = True, func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す """ if r == 0: return 0 r += self.size sm = self.e while True: r -= 1 while r > 1 and r & 1: r >>= 1 if not func(self.op(self.data[r], sm)): while r < self.size: r = r << 1 | 1 if func(self.op(self.data[r], sm)): sm = self.op(self.data[r], sm) r -= 1 return r + 1 - self.size sm = self.op(self.data[r], sm) if (r & -r) == r: break return 0 class LazySegTree(SegTree): def __init__(self, N, op_data, u_data, op_lazy, u_lazy, op_merge): super().__init__(N, op_data, u_data) self.composition = op_lazy self.mapping = op_merge self.id = u_lazy self.lazy = [u_lazy] * self.size def _all_apply(self, i, F): # self.data[i] = self.mapping(F, self.data[i], self.len[i]) self.data[i] = self.mapping(F, self.data[i]) if i < self.size: self.lazy[i] = self.composition(F, self.lazy[i]) def _push(self, i): self._all_apply(i << 1, self.lazy[i]) self._all_apply(i << 1 | 1, self.lazy[i]) self.lazy[i] = self.id def update(self, p, x): """ data[p] = x とする (0-indexed)""" p += self.size for i in reversed(range(1, self.log + 1)): self._push(p >> i) self.data[p] = x for i in range(1, self.log + 1): self._update(p >> i) def apply(self, p, F): """ data[p]にFを作用させる(data[p] = op_merge(F, data[p])とする, 0-indexed) """ p += self.size for i in reversed(range(1, self.log + 1)): self._push(p >> i) # self.data[p] = self.mapping(F, self.data[p], self.len[p]) self.data[p] = self.mapping(F, self.data[p]) for i in range(1, self.log + 1): self._update(p >> i) def range_apply(self, l, r, F): """ i = l, l+1, ..., r-1 について、Fを作用させる(op_merge(F, data[i]), 0-indexed) """ if l == r: return l += self.size r += self.size for i in reversed(range(1, self.log + 1)): # too->down if ((l >> i) << i) != l: self._push(l >> i) if ((r >> i) << i) != r: self._push((r - 1) >> i) l2, r2 = l, r while l < r: if l & 1: self._all_apply(l, F) l += 1 if r & 1: r -= 1 self._all_apply(r, F) l >>= 1 r >>= 1 l, r = l2, r2 for i in range(1, self.log + 1): if ((l >> i) << i) != l: self._update(l >> i) if ((r >> i) << i) != r: self._update((r - 1) >> i) def get(self, p): """ data[p]を返す """ p += self.size for i in reversed(range(1, self.log + 1)): self._push(p >> i) return self.data[p] def prod(self, l, r): """ op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed) l == rの時は単位元u_dataを返す """ if l == r: return self.e l += self.size r += self.size for i in reversed(range(1, self.log + 1)): if ((l >> i) << i) != l: self._push(l >> i) if ((r >> i) << i) != r: self._push(r >> i) sml = self.e smr = self.e while l < r: if l & 1: sml = self.op(sml, self.data[l]) l += 1 if r & 1: r -= 1 smr = self.op(self.data[r], smr) l >>= 1 r >>= 1 return self.op(sml, smr) def max_right(self, l, func): """ func(l, l+1, ..., r-1) = True, func(l, l+1, ..., r-1, r) = Falseとなる r を返す """ if l == self._n: return self._n l += self.size for i in reversed(range(1, self.log + 1)): self._push(l >> i) sm = self.e while True: while l % 2 == 0: l >>= 1 if not func(self.op(sm, self.data[[l]])): while l < self.size: self._push(l) l <<= 1 if func(self.op(sm, self.data[l])): sm = self.op(sm, self.data[l]) l += 1 return l - self.size sm = self.op(sm, self.data[l]) l += 1 if (l & -l) == l: break return self._n def min_left(self, r, func): """ func( l, l+1, ..., r-1) = True, func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す """ if r == 0: return 0 r += self.size for i in reversed(range(1, self.log + 1)): self._push((r - 1) >> i) sm = self.e while True: r -= 1 while r > 1 and r & 1: r >>= 1 if not func(self.op(self.data[r], sm)): while r < self.size: self._push(r) r = r << 1 | 1 if func(self.op(self.data[r], sm)): sm = self.op(self.data[r], sm) r -= 1 return r + 1 - self.size sm = self.op(self.data[r], sm) if (r & -r) == r: break return 0 """ 遅延セグ木(ac-library移植) op_data(d_L, d_R) : d_Lとd_Rの二項演算, dataを返す op_lazy(lz_new, lz_orig) : lz_origにlz_newを作用させる, lazyを返す op_merge(lz, d) : dにlzを作用させる, dataを返す """ N = int(input()) A = list(map(int, input().split())) seg = SegTree(N, gcd, 0) seg.initialize(A) ans = 0 for L in range(N): R = seg.max_right(L, lambda x: x != 1) ans += N - R print(ans)