結果

問題 No.1433 Two color sequence
ユーザー ntudantuda
提出日時 2024-10-17 22:02:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 323 ms / 2,000 ms
コード長 3,892 bytes
コンパイル時間 536 ms
コンパイル使用メモリ 82,376 KB
実行使用メモリ 121,944 KB
最終ジャッジ日時 2024-10-17 22:02:37
合計ジャッジ時間 7,674 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 57 ms
67,820 KB
testcase_01 AC 53 ms
68,884 KB
testcase_02 AC 53 ms
69,080 KB
testcase_03 AC 260 ms
116,072 KB
testcase_04 AC 270 ms
116,552 KB
testcase_05 AC 52 ms
68,980 KB
testcase_06 AC 51 ms
68,328 KB
testcase_07 AC 50 ms
68,104 KB
testcase_08 AC 271 ms
121,944 KB
testcase_09 AC 296 ms
121,816 KB
testcase_10 AC 307 ms
121,232 KB
testcase_11 AC 314 ms
121,072 KB
testcase_12 AC 294 ms
121,248 KB
testcase_13 AC 305 ms
121,744 KB
testcase_14 AC 287 ms
121,248 KB
testcase_15 AC 301 ms
121,464 KB
testcase_16 AC 316 ms
121,448 KB
testcase_17 AC 296 ms
121,332 KB
testcase_18 AC 304 ms
121,584 KB
testcase_19 AC 299 ms
121,436 KB
testcase_20 AC 298 ms
121,568 KB
testcase_21 AC 323 ms
121,924 KB
testcase_22 AC 288 ms
121,188 KB
testcase_23 AC 291 ms
121,348 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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 = _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])

N = int(input())
S = input()
A = list(map(int, input().split()))
B = [0] * (N + 1)
for i in range(N):
    if S[i] == "B":
        A[i] = -A[i]
    B[i + 1] = B[i] + A[i]

INF = 10 ** 15
ST1 = SegTree(max, -INF, B)
ST2 = SegTree(min, INF, B)
ans = 0
for i in range(N + 1):
    ans = max(ans, abs(ST1.prod(i, N + 1) - B[i]))
    ans = max(ans, abs(ST2.prod(i, N + 1) - B[i]))
print(ans)
0