結果
問題 | No.510 二次漸化式 |
ユーザー |
![]() |
提出日時 | 2024-10-09 15:49:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,660 ms / 3,000 ms |
コード長 | 4,882 bytes |
コンパイル時間 | 325 ms |
コンパイル使用メモリ | 82,164 KB |
実行使用メモリ | 139,188 KB |
最終ジャッジ日時 | 2024-10-09 15:50:25 |
合計ジャッジ時間 | 32,770 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 34 |
ソースコード
import sys# sys.setrecursionlimit(200005)# sys.set_int_max_str_digits(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-(-1 << 31)inf = -1-(-1 << 62)md = 10**9+7# md = 998244353import typingclass SegTree:def __init__(self,e: typing.Any,v: typing.Union[int, typing.List[typing.Any]]) -> None:self._e = eif isinstance(v, int):v = [e]*vself._n = len(v)self._log = (self._n-1).bit_length()self._size = 1 << self._logself._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 _op(self, aa, bb):res = [0]*16for i in range(4):for j in range(4):for k in range(4):res[i*4+k] += aa[i*4+j]*bb[j*4+k]%mdreturn [a%md for a in res]def set(self, p: int, x: typing.Any) -> None:assert 0 <= p < self._np += self._sizeself._d[p] = xfor i in range(1, self._log+1):self._update(p >> i)def get(self, p: int) -> typing.Any:assert 0 <= p < self._nreturn self._d[p+self._size]def prod(self, left: int, right: int) -> typing.Any:assert 0 <= left <= right <= self._nsml = self._esmr = self._eleft += self._sizeright += self._sizewhile left < right:if left & 1:sml = self._op(sml, self._d[left])left += 1if right & 1:right -= 1smr = self._op(self._d[right], smr)left >>= 1right >>= 1return 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._nassert f(self._e)if left == self._n:return self._nleft += self._sizesm = self._efirst = Truewhile first or (left & -left) != left:first = Falsewhile left%2 == 0:left >>= 1if not f(self._op(sm, self._d[left])):while left < self._size:left *= 2if f(self._op(sm, self._d[left])):sm = self._op(sm, self._d[left])left += 1return left-self._sizesm = self._op(sm, self._d[left])left += 1return self._ndef min_left(self, right: int,f: typing.Callable[[typing.Any], bool]) -> int:assert 0 <= right <= self._nassert f(self._e)if right == 0:return 0right += self._sizesm = self._efirst = Truewhile first or (right & -right) != right:first = Falseright -= 1while right > 1 and right%2:right >>= 1if not f(self._op(self._d[right], sm)):while right < self._size:right = 2*right+1if f(self._op(self._d[right], sm)):sm = self._op(self._d[right], sm)right -= 1return right+1-self._sizesm = self._op(self._d[right], sm)return 0def _update(self, k: int) -> None:self._d[k] = self._op(self._d[2*k], self._d[2*k+1])e = [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]m = [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1]n = II()st = SegTree(e, [m for _ in range(n)])xx = [0]*nyy = [0]*nupdate = set()for _ in range(II()):q = SI().split()if q[0] == "x":i, v = q[1:]i = int(i)v = int(v)xx[i] = vupdate.add(i)elif q[0] == "y":i, v = q[1:]i = int(i)v = int(v)yy[i] = vupdate.add(i)else:for i in update: st.set(i, [1, 0, 0, 0, 0, yy[i], 2*yy[i], 0, xx[i], 0, yy[i]**2%md, 0, 0, 1, 1, 1])update = set()i = int(q[1])print(sum(st.prod(0, i)[r*4] for r in range(4))%md)