結果
問題 | No.3078 Difference Sum Query |
ユーザー |
![]() |
提出日時 | 2025-03-28 22:54:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,160 ms / 2,000 ms |
コード長 | 4,364 bytes |
コンパイル時間 | 211 ms |
コンパイル使用メモリ | 82,400 KB |
実行使用メモリ | 123,008 KB |
最終ジャッジ日時 | 2025-03-28 22:54:51 |
合計ジャッジ時間 | 23,234 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 26 |
ソースコード
import sys input=sys.stdin.readline import typing def _ceil_pow2(n: int) -> int: x = 0 while (1 << x) < n: x += 1 return x def _bsf(n: int) -> int: x = 0 while n % 2 == 0: x += 1 n //= 2 return x class SegTree: def __init__(self, op: typing.Callable[[typing.Any, typing.Any], typing.Any], e: typing.Any, v: typing.Union[int, typing.List[typing.Any]]) -> None: self._op = op self._e = e if isinstance(v, int): v = [e] * v self._n = len(v) self._log = _ceil_pow2(self._n) self._size = 1 << self._log self._d = [e] * (2 * self._size) for i in range(self._n): self._d[self._size + i] = v[i] for i in range(self._size - 1, 0, -1): self._update(i) def set(self, p: int, x: typing.Any) -> None: assert 0 <= p < self._n p += self._size self._d[p] = x for i in range(1, self._log + 1): self._update(p >> i) def get(self, p: int) -> typing.Any: assert 0 <= p < self._n return self._d[p + self._size] def prod(self, left: int, right: int) -> typing.Any: assert 0 <= left <= right <= self._n sml = self._e smr = self._e left += self._size right += self._size while left < right: if left & 1: sml = self._op(sml, self._d[left]) left += 1 if right & 1: right -= 1 smr = self._op(self._d[right], smr) left >>= 1 right >>= 1 return self._op(sml, smr) def all_prod(self) -> typing.Any: return self._d[1] def max_right(self, left: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= left <= self._n assert f(self._e) if left == self._n: return self._n left += self._size sm = self._e first = True while first or (left & -left) != left: first = False while left % 2 == 0: left >>= 1 if not f(self._op(sm, self._d[left])): while left < self._size: left *= 2 if f(self._op(sm, self._d[left])): sm = self._op(sm, self._d[left]) left += 1 return left - self._size sm = self._op(sm, self._d[left]) left += 1 return self._n def min_left(self, right: int, f: typing.Callable[[typing.Any], bool]) -> int: assert 0 <= right <= self._n assert f(self._e) if right == 0: return 0 right += self._size sm = self._e first = True while first or (right & -right) != right: first = False right -= 1 while right > 1 and right % 2: right >>= 1 if not f(self._op(self._d[right], sm)): while right < self._size: right = 2 * right + 1 if f(self._op(self._d[right], sm)): sm = self._op(self._d[right], sm) right -= 1 return right + 1 - self._size sm = self._op(self._d[right], sm) return 0 def _update(self, k: int) -> None: self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1]) def Sum(a,b): return a+b N,Q=map(int,input().split()) A=list(map(int,input().split())) A_s=A[::] A_s.append(0) for i in range(1,N): A_s[i]+=A_s[i-1] d=[(A[i],0,i) for i in range(N)] for i in range(Q): l,r,x=map(int,input().split()) d.append((x,1,l-1,r-1,i)) d.sort() st_s = SegTree(Sum,0,[0]*N) st_c = SegTree(Sum,0,[0]*N) ans=[0]*Q #print(d) for di in d: if len(di)==3: st_s.set(di[2],di[0]) st_c.set(di[2],1) continue x,_,l,r,i=di all_sum = A_s[r]-A_s[l-1] down_sum = st_s.prod(l,r+1) up_sum = all_sum - down_sum all_count = r-l+1 down_count = st_c.prod(l,r+1) up_count = all_count - down_count #print(f"down_sum{down_sum} down_count{down_count}") ans[i]=(x*down_count-down_sum)+(up_sum-x*up_count) for i in range(Q): print(ans[i])