結果

問題 No.2761 Substitute and Search
ユーザー rlangevinrlangevin
提出日時 2024-05-17 22:35:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,301 ms / 4,000 ms
コード長 4,234 bytes
コンパイル時間 187 ms
コンパイル使用メモリ 82,516 KB
実行使用メモリ 157,476 KB
最終ジャッジ日時 2024-05-17 22:35:50
合計ジャッジ時間 30,094 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
53,584 KB
testcase_01 AC 36 ms
53,276 KB
testcase_02 AC 39 ms
54,112 KB
testcase_03 AC 46 ms
54,040 KB
testcase_04 AC 2,766 ms
157,316 KB
testcase_05 AC 3,301 ms
154,740 KB
testcase_06 AC 1,144 ms
154,768 KB
testcase_07 AC 3,083 ms
157,316 KB
testcase_08 AC 1,193 ms
155,228 KB
testcase_09 AC 3,160 ms
157,112 KB
testcase_10 AC 1,174 ms
154,844 KB
testcase_11 AC 3,195 ms
157,476 KB
testcase_12 AC 2,165 ms
155,672 KB
testcase_13 AC 2,206 ms
155,392 KB
testcase_14 AC 2,149 ms
155,548 KB
testcase_15 AC 2,182 ms
156,332 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

class SegmentTree:
    def __init__(self,
                n,
                identity_e,
                combine_f,
                ):
        self._n = n
        self._size = 1
        while self._size < self._n:
            self._size <<= 1
        self._identity_e = identity_e
        self._combine_f = combine_f
        self._node = [self._identity_e] * (2 * self._size)

    def build(self, array):
        assert len(array) == self._n
        for index, value in enumerate(array, start=self._size):
            self._node[index] = value
        for index in range(self._size - 1, 0, -1):
            self._node[index] = self._combine_f(
                self._node[index << 1 | 0],
                self._node[index << 1 | 1]
            )

    def update(self, index, value):
        i = self._size + index
        self._node[i] = value
        while i > 1:
            i >>= 1
            self._node[i] = self._combine_f(
                self._node[i << 1 | 0],
                self._node[i << 1 | 1]
            )

    def fold(self, L, R):
        L += self._size
        R += self._size
        value_L = self._identity_e
        value_R = self._identity_e
        while L < R:
            if L & 1:
                value_L = self._combine_f(value_L, self._node[L])
                L += 1
            if R & 1:
                R -= 1
                value_R = self._combine_f(self._node[R], value_R)
            L >>= 1
            R >>= 1
        return self._combine_f(value_L, value_R)

    def get(self, p):
        return self._node[p + self._size]

    def max_right(self, l, f):
        assert 0 <= l <= self._n
        assert f(self._identity_e)
        if l == self._n:
            return self._n
        l += self._size
        sm = self._identity_e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not f(self._combine_f(sm, self._node[l])):
                while l < self._size:
                    l <<= 1
                    if f(self._combine_f(sm, self._node[l])):
                        sm = self._combine_f(sm, self._node[l])
                        l += 1
                return l - self._size
            sm = self._combine_f(sm, self._node[l])
            l += 1
            if l & -l == l:
                break
        return self._n

    def min_left(self, r, f):
        assert 0 <= r <= self._n
        assert f(self._identity_e)
        if r == 0:
            return 0
        r += self._size
        sm = self._identity_e
        while True:
            r -= 1
            while r > 1 and r % 2:
                r >>= 1
            if not f(self._combine_f(self._node[r], sm)):
                while r < self._size:
                    r = 2 * r + 1
                    if f(self._combine_f(self._node[r], sm)):
                        sm = self._combine_f(self._node[r], sm)
                        r -= 1
                return r + 1 - self._size
            sm = self._combine_f(self._node[r], sm)
            if r & -r == r:
                break
        return 0

    def __str__(self):
        temp = []
        for i in range(self._n):
            temp.append(str(self.fold(i, i + 1)))
        return ' '.join(temp)
    

N, L, Q = map(int, input().split())
base = 4649
mod = 10**9+9
p = [1] * (L + 1)
for i in range(L):
    p[i + 1] = p[i] * base % mod

def op(x, y):
    x0, x1 = divmod(x, base)
    y0, y1 = divmod(y, base)
    a = (x0 * p[y1] + y0) % mod
    b = x1 + y1
    return a*base+b

T = [SegmentTree(L + 1, 0, op) for i in range(N)]
for i in range(N):
    S = list(input().rstrip())
    for j in range(L):
        T[i].update(j, (ord(S[j]) - ord("a"))*base + 1)
        
for q in range(Q):
    query = list(input().split())
    if query[0] == "1":
        b, c, d = query[1:]
        b = int(b) - 1
        for i in range(N):
            if T[i].get(b) == (ord(c) - ord("a"))*base + 1:
                T[i].update(b, (ord(d) - ord("a"))*base + 1)
    else:
        b = query[1]
        v = 0
        for c in b:
            v = (v*base + ord(c) - ord("a")) % mod
        ans = 0
        for i in range(N):
            if v == T[i].fold(0, len(b))//base:
                ans += 1
        print(ans)
0