結果

問題 No.2992 Range ABCD String Query
ユーザー mkawa2mkawa2
提出日時 2024-12-18 11:16:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 3,979 ms / 6,000 ms
コード長 4,787 bytes
コンパイル時間 410 ms
コンパイル使用メモリ 82,168 KB
実行使用メモリ 291,640 KB
最終ジャッジ日時 2024-12-18 11:18:20
合計ジャッジ時間 110,812 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 617 ms
88,316 KB
testcase_01 AC 624 ms
88,680 KB
testcase_02 AC 775 ms
90,420 KB
testcase_03 AC 737 ms
88,992 KB
testcase_04 AC 982 ms
93,592 KB
testcase_05 AC 674 ms
89,032 KB
testcase_06 AC 792 ms
89,820 KB
testcase_07 AC 454 ms
86,556 KB
testcase_08 AC 1,002 ms
93,428 KB
testcase_09 AC 694 ms
88,924 KB
testcase_10 AC 3,799 ms
269,708 KB
testcase_11 AC 3,518 ms
269,692 KB
testcase_12 AC 3,580 ms
269,632 KB
testcase_13 AC 3,700 ms
269,980 KB
testcase_14 AC 3,763 ms
269,448 KB
testcase_15 AC 3,637 ms
269,580 KB
testcase_16 AC 3,576 ms
266,856 KB
testcase_17 AC 3,979 ms
269,748 KB
testcase_18 AC 3,432 ms
270,388 KB
testcase_19 AC 3,960 ms
269,944 KB
testcase_20 AC 2,718 ms
270,804 KB
testcase_21 AC 2,766 ms
269,932 KB
testcase_22 AC 2,754 ms
271,064 KB
testcase_23 AC 2,701 ms
270,384 KB
testcase_24 AC 2,721 ms
271,396 KB
testcase_25 AC 3,833 ms
291,128 KB
testcase_26 AC 3,901 ms
291,640 KB
testcase_27 AC 3,711 ms
289,976 KB
testcase_28 AC 3,839 ms
291,552 KB
testcase_29 AC 3,882 ms
291,196 KB
testcase_30 AC 3,421 ms
232,104 KB
testcase_31 AC 3,358 ms
232,248 KB
testcase_32 AC 3,457 ms
232,384 KB
testcase_33 AC 2,958 ms
230,756 KB
testcase_34 AC 3,320 ms
231,648 KB
testcase_35 AC 3,536 ms
194,312 KB
testcase_36 AC 3,477 ms
193,844 KB
testcase_37 AC 315 ms
81,728 KB
testcase_38 AC 414 ms
85,784 KB
testcase_39 AC 450 ms
86,780 KB
testcase_40 AC 486 ms
86,636 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,
                 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 op(a, b):
    c = [inf]*16
    for i in range(4):
        for j in range(i, 4):
            for k in range(j,4):
                v=a[i*4+j]+b[j*4+k]
                if v<c[i*4+k]:c[i*4+k]=v
    return c

n, q = LI()
s = [ord(c)-65 for c in SI()]

row = [1]*16
for i in range(4): row[i*4+i] = 1
arr = [[1-(i<=c<=j) for i in range(4) for j in range(4)] for c in s]
# print(arr)
st = SegTree(op, [0]*16, arr)
for _ in range(q):
    t, x, c = SI().split()
    if t == "1":
        x = int1(x)
        c = ord(c)-65
        if s[x] == c: continue
        s[x] = c
        cur = [1-(i<=c<=j) for i in range(4) for j in range(4)]
        st.set(x, cur)
    else:
        l, r = int1(x), int(c)
        ans = st.prod(l,r)[3]
        print(ans)
0