結果

問題 No.877 Range ReLU Query
ユーザー noriocnorioc
提出日時 2024-06-11 05:48:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,976 ms / 2,000 ms
コード長 5,199 bytes
コンパイル時間 413 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 205,152 KB
最終ジャッジ日時 2024-06-11 05:48:57
合計ジャッジ時間 20,361 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 61 ms
68,480 KB
testcase_01 AC 147 ms
79,232 KB
testcase_02 AC 117 ms
78,976 KB
testcase_03 AC 122 ms
78,976 KB
testcase_04 AC 85 ms
78,172 KB
testcase_05 AC 100 ms
78,464 KB
testcase_06 AC 105 ms
78,972 KB
testcase_07 AC 101 ms
79,168 KB
testcase_08 AC 162 ms
80,128 KB
testcase_09 AC 95 ms
78,336 KB
testcase_10 AC 113 ms
78,848 KB
testcase_11 AC 1,958 ms
197,612 KB
testcase_12 AC 1,657 ms
197,120 KB
testcase_13 AC 1,265 ms
136,316 KB
testcase_14 AC 1,359 ms
136,052 KB
testcase_15 AC 1,965 ms
196,684 KB
testcase_16 AC 1,976 ms
194,176 KB
testcase_17 AC 1,962 ms
196,608 KB
testcase_18 AC 1,922 ms
196,976 KB
testcase_19 AC 847 ms
205,152 KB
testcase_20 AC 1,591 ms
205,012 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing
import sys
input = sys.stdin.readline


try:
    import pypyjit
    pypyjit.set_param('max_unroll_recursion=-1')
except ModuleNotFoundError:
    pass

def _ceil_pow2(n: int) -> int:
    x = 0
    while (1 << x) < n:
        x += 1

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


from bisect import bisect_right
from itertools import accumulate, islice


# ソート済みリスト a, b をマージ
def merge(a: list, b: list) -> list:
    na, nb = len(a), len(b)
    pa = pb = 0
    res = []
    while pa < na and pb < nb:
        if a[pa] <= b[pb]:
            res.append(a[pa])
            pa += 1
        else:
            res.append(b[pb])
            pb += 1
    res.extend(islice(a, pa, na))
    res.extend(islice(b, pb, nb))
    return res


# 構築用
class D:
    def __init__(self, xs):
        self.xs = xs  # ソート済みリスト
        self.acc = list(accumulate(xs))

    # \sum max(a_i - x, 0) を返す
    def sum(self, x) -> int:
        p = bisect_right(self.xs, x)
        s = self.acc[-1]
        if p > 0: s -= self.acc[p-1]  # x 以下は 0 扱い
        s -= x * (len(self.xs) - p)   # x 以上は個数分の x を引く
        return s

    def get_sum(self) -> int:
        return self.sum(target)


# クエリ用
class S:
    def __init__(self, sum):
        self.sum = sum  # x 以下の総和

    def get_sum(self) -> int:
        return self.sum


# 構築用
def op_build(a: D, b: D) -> D:
    return D(merge(a.xs, b.xs))


# クエリ用
def op_query(a: D | S, b: D | S) -> S:
    return S(a.get_sum() + b.get_sum())


INF = 1 << 60
N, Q = map(int, input().split())
A = list(map(int, input().split()))

target = 0  # 検索する値
segt = SegTree(op_build, D([0]), [D([a]) for a in A])
segt._op = op_query  # クエリ用に差し替え

for _ in range(Q):
    _, l, r, x = map(int, input().split())
    l -= 1
    target = x
    res = segt.prod(l, r).get_sum()
    print(res)
0