結果
| 問題 | No.510 二次漸化式 |
| ユーザー |
 mkawa2
|
| 提出日時 | 2024-10-09 09:02:14 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 5,101 bytes |
| コンパイル時間 | 402 ms |
| コンパイル使用メモリ | 82,184 KB |
| 実行使用メモリ | 231,436 KB |
| 最終ジャッジ日時 | 2024-10-09 09:03:24 |
| 合計ジャッジ時間 | 70,216 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 73 ms
72,080 KB |
| testcase_01 | AC | 72 ms
73,420 KB |
| testcase_02 | AC | 1,436 ms
106,356 KB |
| testcase_03 | AC | 1,384 ms
106,704 KB |
| testcase_04 | AC | 1,493 ms
107,216 KB |
| testcase_05 | AC | 1,514 ms
107,288 KB |
| testcase_06 | AC | 2,020 ms
132,772 KB |
| testcase_07 | AC | 1,974 ms
132,604 KB |
| testcase_08 | AC | 1,944 ms
134,532 KB |
| testcase_09 | AC | 1,930 ms
132,244 KB |
| testcase_10 | AC | 736 ms
82,320 KB |
| testcase_11 | AC | 706 ms
82,016 KB |
| testcase_12 | AC | 718 ms
83,804 KB |
| testcase_13 | AC | 766 ms
83,808 KB |
| testcase_14 | AC | 810 ms
85,028 KB |
| testcase_15 | AC | 779 ms
83,128 KB |
| testcase_16 | AC | 1,886 ms
178,080 KB |
| testcase_17 | AC | 2,071 ms
180,808 KB |
| testcase_18 | AC | 1,982 ms
177,512 KB |
| testcase_19 | AC | 1,992 ms
177,988 KB |
| testcase_20 | AC | 1,923 ms
178,060 KB |
| testcase_21 | AC | 1,910 ms
179,800 KB |
| testcase_22 | AC | 1,913 ms
178,440 KB |
| testcase_23 | AC | 2,909 ms
208,756 KB |
| testcase_24 | AC | 2,895 ms
208,504 KB |
| testcase_25 | AC | 2,918 ms
209,016 KB |
| testcase_26 | AC | 2,916 ms
208,416 KB |
| testcase_27 | AC | 2,958 ms
209,048 KB |
| testcase_28 | AC | 2,994 ms
209,040 KB |
| testcase_29 | TLE | - |
| testcase_30 | TLE | - |
| testcase_31 | AC | 2,106 ms
231,436 KB |
| testcase_32 | AC | 2,075 ms
231,340 KB |
| testcase_33 | AC | 2,100 ms
231,228 KB |
| testcase_34 | TLE | - |
| testcase_35 | AC | 2,531 ms
150,588 KB |
ソースコード
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = 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 = 998244353
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._n-1).bit_length()
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 dot(aa, bb):
h = len(aa)
w = len(bb[0])
res = [[0]*w for _ in range(h)]
for i, row in enumerate(aa):
for j, col in enumerate(zip(*bb)):
v = 0
# for a, b in zip(row, col): v += a*b
for a, b in zip(row, col): v = (v+a*b)%md
res[i][j] = v
return res
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(dot, e, [m for _ in range(n)])
xx = [0]*n
yy = [0]*n
update=set()
for _ in range(II()):
q = SI().split()
if q[0] == "x":
i, v = q[1:]
i = int(i)
v = int(v)
xx[i] = v
update.add(i)
elif q[0] == "y":
i, v = q[1:]
i = int(i)
v = int(v)
yy[i] = v
update.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.clear()
i = int(q[1])
print(sum(st.prod(0, i)[r][0] for r in range(4))%md)