結果

問題 No.2992 Range ABCD String Query
ユーザー hiro1729hiro1729
提出日時 2024-12-16 20:44:24
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,338 bytes
コンパイル時間 141 ms
コンパイル使用メモリ 82,384 KB
実行使用メモリ 386,060 KB
最終ジャッジ日時 2024-12-16 23:53:00
合計ジャッジ時間 151,880 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,553 ms
386,024 KB
testcase_01 AC 1,476 ms
386,060 KB
testcase_02 AC 2,162 ms
109,576 KB
testcase_03 AC 1,876 ms
103,328 KB
testcase_04 AC 2,333 ms
114,528 KB
testcase_05 AC 1,603 ms
99,448 KB
testcase_06 AC 2,174 ms
108,384 KB
testcase_07 AC 866 ms
89,440 KB
testcase_08 AC 2,437 ms
113,064 KB
testcase_09 AC 1,760 ms
102,436 KB
testcase_10 TLE -
testcase_11 TLE -
testcase_12 TLE -
testcase_13 TLE -
testcase_14 TLE -
testcase_15 TLE -
testcase_16 TLE -
testcase_17 TLE -
testcase_18 TLE -
testcase_19 TLE -
testcase_20 AC 2,832 ms
286,572 KB
testcase_21 AC 2,863 ms
286,592 KB
testcase_22 AC 2,842 ms
285,004 KB
testcase_23 AC 2,731 ms
288,228 KB
testcase_24 AC 2,805 ms
287,560 KB
testcase_25 AC 3,242 ms
309,804 KB
testcase_26 AC 3,226 ms
309,976 KB
testcase_27 AC 3,191 ms
308,300 KB
testcase_28 AC 3,178 ms
309,108 KB
testcase_29 AC 3,249 ms
306,108 KB
testcase_30 AC 5,002 ms
264,276 KB
testcase_31 AC 5,481 ms
277,028 KB
testcase_32 AC 4,704 ms
265,192 KB
testcase_33 AC 5,457 ms
276,444 KB
testcase_34 AC 4,889 ms
268,372 KB
testcase_35 AC 1,879 ms
162,760 KB
testcase_36 AC 1,821 ms
163,140 KB
testcase_37 AC 378 ms
79,676 KB
testcase_38 AC 649 ms
84,612 KB
testcase_39 AC 859 ms
88,916 KB
testcase_40 AC 970 ms
377,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict

import typing

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


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 op(l, r):
	return (l[0] + r[0], min(l[0] + r[1], l[1] + r[4]), min(l[0] + r[2], l[1] + r[5], l[2] + r[7]), min(l[0] + r[3], l[1] + r[6], l[2] + r[8], l[3] + r[9]), l[4] + r[4], min(l[4] + r[5], l[5] + r[7]), min(l[4] + r[6], l[5] + r[8], l[6] + r[9]), l[7] + r[7], min(l[7] + r[8], l[8] + r[9]), l[9] + r[9])

e = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0)

d = defaultdict(tuple)
d['A'] = (0, 0, 0, 0, 1, 1, 1, 1, 1, 1)
d['B'] = (1, 0, 0, 0, 0, 0, 0, 1, 1, 1)
d['C'] = (1, 1, 0, 0, 1, 0, 0, 0, 0, 1)
d['D'] = (1, 1, 1, 0, 1, 1, 0, 1, 0, 0)

N, Q = map(int, input().split())
S = input()
v = [d[i] for i in S]
seg = SegTree(op, e, v)
for _ in range(Q):
	t, a, b = input().split()
	if t == '1':
		a = int(a) - 1
		seg.set(a, d[b])
	else:
		a = int(a) - 1
		b = int(b) - 1
		print(seg.prod(a, b + 1)[3])
0