結果
問題 |
No.3227 Matrix Query
|
ユーザー |
|
提出日時 | 2025-08-08 22:44:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,202 ms / 8,000 ms |
コード長 | 4,641 bytes |
コンパイル時間 | 296 ms |
コンパイル使用メモリ | 82,240 KB |
実行使用メモリ | 129,336 KB |
最終ジャッジ日時 | 2025-08-08 22:45:03 |
合計ジャッジ時間 | 22,154 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
import typing 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 = self._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 _ceil_pow2(self, n: int) -> int: x = 0 while (1 << x) < n: x += 1 return x # 非再帰のセグ木 ACL (https://github.com/not522/ac-library-python/blob/master/atcoder/segtree.py) K, N = map(int, input().split()) A = [] for _ in range(N): a, b = map(int, input().split()) c, d = map(int, input().split()) A.append((a, b, c, d)) def op(X, Y): a, b, c, d = X e, f, g, h = Y return ((a*e+b*g)%K, (a*f+b*h)%K, (c*e+d*g)%K, (c*f+d*h)%K) e = (1, 0, 0, 1) # 単位元 Z = SegTree(op, e, A) # Z = SegTree(op, e, A)で、そのままリストAを渡すなら、下記のsetしていく過程は必要なし。 #for i in range(N): # Z.set(i, A[i]) # Z[i] に 値をセット Z[0]~Z[N-1] #for i in range(N): # print(Z.get(i)) # Z[i] の 値をゲット Z[0]~Z[N-1] #print(Z.prod(0, 4)) # Z[0]からZ[3]までの演算結果 Z.prod(l, r)の演算結果は [l, r) であることに注意。 Q = int(input()) for _ in range(Q): i, L, R = map(int, input().split()) i -= 1 L -= 1 R -= 1 a, b = map(int, input().split()) c, d = map(int, input().split()) Z.set(i, (a, b, c, d)) a, b, c, d = Z.prod(L, R + 1) # # Z[L]からZ[R]までのクエリ print(a, b) print(c, d)