結果

問題 No.3208 Parse AND OR Affection
ユーザー kidodesu
提出日時 2025-07-18 23:03:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,729 ms / 5,000 ms
コード長 5,706 bytes
コンパイル時間 360 ms
コンパイル使用メモリ 82,732 KB
実行使用メモリ 213,908 KB
最終ジャッジ日時 2025-07-18 23:04:17
合計ジャッジ時間 48,724 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

def mat_mul(A, B, f = 1): #行列同士と行列ベクトルの積を計算
    n = len(A) 
    if f: #modの計算を行うか分岐
        global mod
        if isinstance(B[0], list): #行列同士の積か分岐
            C = [[0 for _ in range(n)] for _ in range(n)]
            for y in range(n):
                for x in range(n):
                    for d in range(n):
                        C[y][x] += A[y][d] * B[d][x] % mod
                        C[y][x] %= mod
            return C
        else:
            C = [0 for _ in range(n)]
            for y in range(n):
                for x in range(n):
                    C[y] += A[y][x] * B[x] % mod
                    C[y] %= mod
            return C
    else:
        if isinstance(B[0], list):
            C = [[0 for _ in range(n)] for _ in range(n)]
            for y in range(n):
                for x in range(n):
                    for d in range(n):
                        C[y][x] += A[y][d] * B[d][x]
            return C
        else:
            C = [0 for _ in range(n)]
            for y in range(n):
                for x in range(n):
                    C[y] += A[y][x] * B[x]
            return C


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

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 = _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 segfunc(A, B):
    return mat_mul(B, A, 0)

e = [[1 if i == j else 0 for j in range(4)] for i in range(4)]
n, q = map(int, input().split())
X = input()
init_val = []
for i in range(1, n, 2):
    T = X[i: i+2]
    if T == "+T":
        tmp = [[1, 1, 0, 1], [0, 0, 0, 0], [1, 1, 1, 1], [0, 0, 0, 1]]
    elif T == "+F" or T == "*T" or T == "^F":
        tmp = [[1, 0, 0, 0], [0, 1, 0, 1], [1, 0, 1, 0], [0, 0, 0, 1]]
        if T[1] == "T":
            tmp[1][3] -= 1
            tmp[2][3] += 1
            tmp[0][3] += 1
    elif T == "*F":
        tmp = [[0, 0, 0, 0], [1, 1, 0, 1], [0, 0, 1, 0], [0, 0, 0, 1]]
    elif T == "^T":
        tmp = [[0, 1, 0, 1], [1, 0, 0, 0], [0, 1, 1, 1], [0, 0, 0, 1]]
    init_val.append(tmp)

st = SegTree(segfunc, e, init_val)
for _ in range(q):
    l, r = map(int, input().split())
    t = l-1
    l = l//2
    r = r//2
    if X[t] == "T":
        tmp = [1, 0, 1, 1]
    else:
        tmp = [0, 1, 0, 1]
    D = st.prod(l, r)
    Ans = mat_mul(D, tmp, 0)
    print(Ans[2])
0