結果

問題 No.2992 Range ABCD String Query
ユーザー mkawa2mkawa2
提出日時 2024-12-17 23:35:36
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,806 bytes
コンパイル時間 521 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 506,564 KB
最終ジャッジ日時 2024-12-17 23:39:54
合計ジャッジ時間 175,716 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,088 ms
90,132 KB
testcase_01 AC 984 ms
89,380 KB
testcase_02 AC 1,430 ms
94,960 KB
testcase_03 AC 1,095 ms
91,644 KB
testcase_04 AC 1,563 ms
97,380 KB
testcase_05 AC 1,003 ms
92,168 KB
testcase_06 AC 1,190 ms
93,552 KB
testcase_07 AC 730 ms
88,132 KB
testcase_08 AC 1,563 ms
97,656 KB
testcase_09 AC 999 ms
91,592 KB
testcase_10 TLE -
testcase_11 TLE -
testcase_12 AC 5,652 ms
268,892 KB
testcase_13 TLE -
testcase_14 AC 5,629 ms
268,708 KB
testcase_15 AC 5,816 ms
268,896 KB
testcase_16 AC 5,309 ms
267,372 KB
testcase_17 TLE -
testcase_18 AC 5,368 ms
268,452 KB
testcase_19 TLE -
testcase_20 AC 4,482 ms
269,212 KB
testcase_21 AC 4,130 ms
269,184 KB
testcase_22 AC 4,169 ms
268,832 KB
testcase_23 AC 4,525 ms
269,560 KB
testcase_24 AC 4,623 ms
269,096 KB
testcase_25 TLE -
testcase_26 TLE -
testcase_27 TLE -
testcase_28 TLE -
testcase_29 TLE -
testcase_30 AC 5,939 ms
237,856 KB
testcase_31 AC 5,637 ms
237,736 KB
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 TLE -
testcase_36 TLE -
testcase_37 AC 424 ms
82,304 KB
testcase_38 AC 621 ms
87,580 KB
testcase_39 AC 690 ms
87,716 KB
testcase_40 AC 763 ms
87,676 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 p in range(j, 4):
                for q in range(p, 4):
                    c[i*4+q] = min(c[i*4+q], a[i*4+j]+b[p*4+q])
    return c

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

row = [inf]*16
for i in range(4): row[i*4+i] = 1
arr = []
for c in s:
    cur = row[:]
    cur[c*4+c] = 0
    arr.append(cur)
# 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 = row[:]
        cur[c*4+c] = 0
        st.set(x, cur)
    else:
        l, r = int1(x), int(c)
        ans = min(st.prod(l, r))
        print(ans)
0