結果

問題 No.165 四角で囲え！
ユーザー norioc
提出日時 2025-03-19 14:31:08
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,202 ms / 5,000 ms
コード長 5,195 bytes
コンパイル時間 910 ms
コンパイル使用メモリ 82,240 KB
実行使用メモリ 104,600 KB
最終ジャッジ日時 2025-03-19 14:31:51
合計ジャッジ時間 37,160 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing
import sys
input = sys.stdin.readline


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


class Compression:
    def __init__(self, iterable):
        self.vs = sorted(set(iterable))
        self.n = len(self.vs)
        self.v2i = {}
        for i, val in enumerate(self.vs):
            self.v2i[val] = i

    def __len__(self):
        return self.n

    def index(self, val):
        """val のインデックスを返す"""
        return self.v2i[val]

    def value(self, index):
        """インデックスに対応する値を返す"""
        return self.vs[index]


from collections import defaultdict
from itertools import accumulate, combinations


def accum(a: list):
    acc = list(accumulate(a))
    return lambda l, r: acc[r] - (acc[l-1] if l > 0 else 0)


N, B = map(int, input().split())
ps = []
s = set()
for _ in range(N):
    X, Y, P = map(int, input().split())
    ps.append((X, Y, P))
    s.add(X)
    s.add(Y)

comp = Compression(s)
xmap = defaultdict(list)
for x, y, p in ps:
    cx = comp.index(x)
    cy = comp.index(y)
    xmap[cx].append((cy, p))


def calc(lx: int, rx: int) -> int:
    n = len(comp)+10
    scores = [0] * n
    freq = [0] * n
    yset = set()

    for x in range(lx, rx+1):
        for y, p in xmap[x]:
            #segt.set(y, segt.get(y) + p)
            scores[y] += p
            freq[y] += 1
            yset.add(y)

    segt = SegTree(lambda a, b: a+b, 0, scores)
    #print(f'{n=}')
    acc = accum(freq)
    res = 0
    for l in sorted(yset):
        r = segt.max_right(l, lambda x: x <= B)
        if l < r:
            res = max(res, acc(l, r-1))
        if r == n: break

    return res


ans =  0
xkeys = sorted(xmap.keys())
for i in range(len(xkeys)):
    for j in range(i, len(xkeys)):
        l = xkeys[i]
        r = xkeys[j]
        ans = max(ans, calc(l, r))

print(ans)
0