結果

問題 No.510 二次漸化式
ユーザー mkawa2mkawa2
提出日時 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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
70,996 KB
testcase_01 AC 70 ms
72,612 KB
testcase_02 AC 568 ms
88,880 KB
testcase_03 AC 608 ms
88,588 KB
testcase_04 AC 604 ms
89,100 KB
testcase_05 AC 642 ms
88,744 KB
testcase_06 AC 839 ms
99,592 KB
testcase_07 AC 812 ms
99,092 KB
testcase_08 AC 806 ms
98,628 KB
testcase_09 AC 804 ms
99,524 KB
testcase_10 AC 356 ms
81,728 KB
testcase_11 AC 355 ms
80,800 KB
testcase_12 AC 366 ms
80,900 KB
testcase_13 AC 433 ms
82,036 KB
testcase_14 AC 374 ms
82,496 KB
testcase_15 AC 433 ms
82,700 KB
testcase_16 AC 848 ms
120,644 KB
testcase_17 AC 957 ms
122,020 KB
testcase_18 AC 976 ms
121,760 KB
testcase_19 AC 963 ms
121,000 KB
testcase_20 AC 846 ms
120,768 KB
testcase_21 AC 881 ms
121,020 KB
testcase_22 AC 881 ms
120,648 KB
testcase_23 AC 1,235 ms
131,904 KB
testcase_24 AC 1,203 ms
132,160 KB
testcase_25 AC 1,263 ms
132,208 KB
testcase_26 AC 1,240 ms
132,264 KB
testcase_27 AC 1,220 ms
132,532 KB
testcase_28 AC 1,660 ms
134,604 KB
testcase_29 AC 1,273 ms
132,920 KB
testcase_30 AC 1,315 ms
133,212 KB
testcase_31 AC 903 ms
138,752 KB
testcase_32 AC 887 ms
138,948 KB
testcase_33 AC 859 ms
139,188 KB
testcase_34 AC 1,236 ms
114,168 KB
testcase_35 AC 1,024 ms
112,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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,
                 e: typing.Any,
                 v: typing.Union[int, typing.List[typing.Any]]) -> None:
        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 _op(self, aa, bb):
        res = [0]*16
        for 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]%md
        return [a%md for a in res]

    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])

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]*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 = set()
        i = int(q[1])
        print(sum(st.prod(0, i)[r*4] for r in range(4))%md)
0