結果

問題 No.2422 regisys?
コンテスト
ユーザー norioc
提出日時 2025-10-17 01:58:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 788 ms / 2,000 ms
コード長 4,659 bytes
コンパイル時間 402 ms
コンパイル使用メモリ 82,412 KB
実行使用メモリ 148,040 KB
最終ジャッジ日時 2025-10-17 01:59:25
合計ジャッジ時間 22,855 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 61
権限があれば一括ダウンロードができます

ソースコード

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


N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

items = [(a, b) for a, b in zip(A, B)]
xs = []  # 一般人
ys = []  # MMA 部員
for _ in range(M):
    T, C = map(int, input().split())
    if T == 0:
        xs.append(C)
    else:
        ys.append(C)

items.sort(key=lambda x: x[0])
segt = SegTree(max, (0, 0), [(b, i) for i, (_, b) in enumerate(items)])
used = set()
for x in sorted(xs):
    # 購入できる最大の商品
    res = -1
    lo = 0
    hi = len(items)-1
    while lo <= hi:
        m = (lo + hi) // 2
        if items[m][0] <= x:
            res = max(res, m)
            lo = m + 1
        else:
            hi = m - 1

    if res == -1: continue  # 購入できない

    b, i = segt.prod(0, res+1)
    if b == 0: continue  # 区間内に購入できる商品がない
    used.add(i)
    segt.set(i, (0, -1))

rest = []  # 残り商品(MMA 部員が購入)
for i, (a, b) in enumerate(items):
    if i in used: continue

    rest.append(b)

rest.sort()
ys.sort()
buy = len(used)
while rest and ys:
    if rest[-1] <= ys[-1]:
        buy += 1
        rest.pop()
        ys.pop()
    else:
        rest.pop()

ans = N - buy
print(ans)
0