結果

問題 No.2992 Range ABCD String Query
ユーザー 👑 rin204rin204
提出日時 2024-12-17 00:12:58
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 5,855 ms / 6,000 ms
コード長 4,162 bytes
コンパイル時間 403 ms
コンパイル使用メモリ 82,092 KB
実行使用メモリ 274,816 KB
最終ジャッジ日時 2024-12-17 00:16:18
合計ジャッジ時間 154,219 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,290 ms
82,796 KB
testcase_01 AC 1,213 ms
82,944 KB
testcase_02 AC 1,483 ms
84,560 KB
testcase_03 AC 1,395 ms
83,048 KB
testcase_04 AC 1,545 ms
87,132 KB
testcase_05 AC 1,333 ms
82,968 KB
testcase_06 AC 1,460 ms
84,204 KB
testcase_07 AC 989 ms
81,792 KB
testcase_08 AC 1,622 ms
87,660 KB
testcase_09 AC 1,320 ms
83,092 KB
testcase_10 AC 5,597 ms
274,148 KB
testcase_11 AC 5,651 ms
273,744 KB
testcase_12 AC 5,520 ms
273,664 KB
testcase_13 AC 5,416 ms
273,388 KB
testcase_14 AC 5,388 ms
274,816 KB
testcase_15 AC 5,029 ms
273,624 KB
testcase_16 AC 4,770 ms
270,876 KB
testcase_17 AC 5,209 ms
273,672 KB
testcase_18 AC 5,166 ms
273,160 KB
testcase_19 AC 5,609 ms
274,032 KB
testcase_20 AC 3,752 ms
273,264 KB
testcase_21 AC 3,858 ms
273,500 KB
testcase_22 AC 3,925 ms
272,668 KB
testcase_23 AC 3,839 ms
273,864 KB
testcase_24 AC 3,760 ms
272,772 KB
testcase_25 AC 5,644 ms
274,420 KB
testcase_26 AC 5,642 ms
274,276 KB
testcase_27 AC 5,855 ms
274,656 KB
testcase_28 AC 5,764 ms
274,312 KB
testcase_29 AC 5,552 ms
274,196 KB
testcase_30 AC 4,765 ms
246,848 KB
testcase_31 AC 4,834 ms
247,852 KB
testcase_32 AC 4,577 ms
247,448 KB
testcase_33 AC 4,620 ms
247,604 KB
testcase_34 AC 4,500 ms
246,648 KB
testcase_35 AC 4,305 ms
149,380 KB
testcase_36 AC 4,184 ms
149,868 KB
testcase_37 AC 565 ms
77,604 KB
testcase_38 AC 784 ms
79,776 KB
testcase_39 AC 996 ms
81,176 KB
testcase_40 AC 958 ms
81,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class SegmentTreeBase_:
    def ope(self, l, r):
        raise NotImplementedError

    def e(self):
        raise NotImplementedError

    def __init__(self, n, init=None):
        self.n = n
        self.n0 = 1 << (n - 1).bit_length()
        self.data = [self.e()] * (2 * self.n0)
        if init is not None:
            for i in range(n):
                self.data[self.n0 + i] = init[i]
            for i in range(self.n0 - 1, 0, -1):
                self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])

    def build(self):
        for i in range(self.n0 - 1, 0, -1):
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])

    def set(self, i, x):
        i += self.n0
        self.data[i] = x
        while i > 1:
            i >>= 1
            self.data[i] = self.ope(self.data[2 * i], self.data[2 * i + 1])

    def get(self, i):
        return self.data[i + self.n0]

    def __getitem__(self, i):
        return self.data[i + self.n0]

    def __setitem__(self, i, x):
        self.set(i, x)

    def prod(self, l, r):
        assert 0 <= l <= r <= self.n0
        l += self.n0
        r += self.n0
        lles = self.e()
        rres = self.e()
        while l < r:
            if l & 1:
                lles = self.ope(lles, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                rres = self.ope(self.data[r], rres)
            l >>= 1
            r >>= 1
        return self.ope(lles, rres)

    def max_right(self, l, f):
        if l == self.n:
            return self.n
        l += self.n0
        sm = self.e()
        while 1:
            while l % 2 == 0:
                l >>= 1
            if not f(self.ope(sm, self.data[l])):
                while l < self.n0:
                    l <<= 1
                    if f(self.ope(sm, self.data[l])):
                        sm = self.ope(sm, self.data[l])
                        l += 1
                return l - self.n0
            sm = self.ope(sm, self.data[l])
            l += 1
            if l & -l == l:
                break
        return self.n

    def min_left(self, r, f):
        if r == 0:
            return 0
        r += self.n0
        sm = self.e()
        while 1:
            r -= 1
            while r > 1 and r % 2:
                r >>= 1
            if not f(self.ope(self.data[r], sm)):
                while r < self.n0:
                    r = 2 * r + 1
                    if f(self.ope(self.data[r], sm)):
                        sm = self.ope(self.data[r], sm)
                        r -= 1
                return r + 1 - self.n0
            sm = self.ope(self.data[r], sm)
            if r & -r == r:
                break
        return 0


class segtree(SegmentTreeBase_):
    def ope(self, l, r):
        ret = [0] * 16
        for i in range(4):
            for j in range(i, 4):
                x = 0
                for k in range(i, j + 1):
                    x = max(x, l[i * 4 + k] + r[k * 4 + j])
                ret[i * 4 + j] = x
        return tuple(ret)

    def e(self):
        return (0,) * 16


n, Q = map(int, input().split())
S = input()
a = [0] * 16
b = [0] * 16
c = [0] * 16
d = [0] * 16
for i in range(4):
    for j in range(i, 4):
        if i <= 0 <= j:
            a[i * 4 + j] = 1
        if i <= 1 <= j:
            b[i * 4 + j] = 1
        if i <= 2 <= j:
            c[i * 4 + j] = 1
        if i <= 3 <= j:
            d[i * 4 + j] = 1

tup_a = tuple(a)
tup_b = tuple(b)
tup_c = tuple(c)
tup_d = tuple(d)

data = [None] * n
for i, s in enumerate(S):
    if s == "A":
        data[i] = tup_a
    elif s == "B":
        data[i] = tup_b
    elif s == "C":
        data[i] = tup_c
    else:
        data[i] = tup_d


seg = segtree(n, data)

for _ in range(Q):
    query = input().split()
    if query[0] == "1":
        x, c = int(query[1]) - 1, query[2]
        if c == "A":
            seg.set(x, tup_a)
        elif c == "B":
            seg.set(x, tup_b)
        elif c == "C":
            seg.set(x, tup_c)
        else:
            seg.set(x, tup_d)
    else:
        l, r = map(int, query[1:])
        print(r - l + 1 - seg.prod(l - 1, r)[3])
0