結果

問題 No.2761 Substitute and Search
コンテスト
ユーザー norioc
提出日時 2025-05-07 04:33:13
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,737 bytes
コンパイル時間 839 ms
コンパイル使用メモリ 82,188 KB
実行使用メモリ 337,416 KB
最終ジャッジ日時 2025-05-07 04:33:23
合計ジャッジ時間 9,146 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 1 TLE * 1 -- * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing
import sys
input = sys.stdin.readline


def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

    return x


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


class RollingHashOnSegTree:
    def __init__(self, s: str):
        def op(a: tuple[int, int], b: tuple[int, int]) -> tuple[int, int]:
            # (ハッシュ値, 区間の長さ)
            a_h, a_size = a
            b_h, b_size = b
            h = a_h * pow(self.B, b_size, self.MOD) + b_h
            h %= self.MOD
            return h, a_size + b_size

        self.B = 1009
        self.MOD = 998244353
        self.segt = SegTree(op, (0, 0), [(ord(c), 1) for c in s])

    def get(self, p) -> str:
        h, _ = self.segt.get(p)
        return chr(h)

    def set(self, p: int, c: str):
        assert len(c) == 1
        self.segt.set(p, (ord(c), 1))

    def prod(self, l: int, r: int) -> int:
        h, size = self.segt.prod(l, r)
        return h


N, L, Q = map(int, input().split())

hs = []
for _ in range(N):
    S = input()
    hs.append(RollingHashOnSegTree(S))

for _ in range(Q):
    qs = input().split()
    if qs[0] == '1':
        k, c, d = int(qs[1])-1, qs[2], qs[3]
        for h in hs:
            if h.get(k) == c:
                h.set(k, d)
    elif qs[0] == '2':
        t = qs[1]
        th = RollingHashOnSegTree(t).prod(0, len(t))
        res = 0
        for h in hs:
            if h.prod(0, len(t)) == th:
                res += 1

        print(res)
0