結果

問題 No.2422 regisys?
ユーザー kemunikukemuniku
提出日時 2023-08-12 15:23:05
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,129 ms / 2,000 ms
コード長 5,197 bytes
コンパイル時間 203 ms
コンパイル使用メモリ 82,316 KB
実行使用メモリ 153,100 KB
最終ジャッジ日時 2024-11-20 01:47:00
合計ジャッジ時間 24,594 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
68,096 KB
testcase_01 AC 68 ms
68,608 KB
testcase_02 AC 67 ms
68,736 KB
testcase_03 AC 66 ms
68,608 KB
testcase_04 AC 68 ms
68,352 KB
testcase_05 AC 71 ms
69,248 KB
testcase_06 AC 71 ms
69,376 KB
testcase_07 AC 69 ms
68,992 KB
testcase_08 AC 68 ms
69,248 KB
testcase_09 AC 66 ms
68,224 KB
testcase_10 AC 67 ms
68,736 KB
testcase_11 AC 68 ms
69,120 KB
testcase_12 AC 66 ms
68,224 KB
testcase_13 AC 68 ms
68,608 KB
testcase_14 AC 65 ms
67,968 KB
testcase_15 AC 69 ms
68,864 KB
testcase_16 AC 68 ms
68,608 KB
testcase_17 AC 67 ms
68,992 KB
testcase_18 AC 67 ms
68,224 KB
testcase_19 AC 68 ms
69,120 KB
testcase_20 AC 70 ms
69,376 KB
testcase_21 AC 67 ms
68,736 KB
testcase_22 AC 67 ms
68,992 KB
testcase_23 AC 68 ms
69,248 KB
testcase_24 AC 66 ms
68,704 KB
testcase_25 AC 67 ms
68,096 KB
testcase_26 AC 65 ms
68,224 KB
testcase_27 AC 67 ms
68,736 KB
testcase_28 AC 67 ms
68,608 KB
testcase_29 AC 67 ms
68,096 KB
testcase_30 AC 66 ms
68,736 KB
testcase_31 AC 442 ms
100,752 KB
testcase_32 AC 471 ms
99,348 KB
testcase_33 AC 443 ms
101,512 KB
testcase_34 AC 244 ms
85,632 KB
testcase_35 AC 501 ms
108,088 KB
testcase_36 AC 366 ms
91,776 KB
testcase_37 AC 529 ms
102,680 KB
testcase_38 AC 305 ms
90,364 KB
testcase_39 AC 255 ms
86,784 KB
testcase_40 AC 322 ms
89,672 KB
testcase_41 AC 304 ms
88,712 KB
testcase_42 AC 794 ms
139,904 KB
testcase_43 AC 471 ms
97,348 KB
testcase_44 AC 854 ms
140,380 KB
testcase_45 AC 711 ms
128,192 KB
testcase_46 AC 866 ms
140,832 KB
testcase_47 AC 509 ms
105,116 KB
testcase_48 AC 885 ms
148,264 KB
testcase_49 AC 632 ms
114,220 KB
testcase_50 AC 812 ms
146,864 KB
testcase_51 AC 929 ms
140,576 KB
testcase_52 AC 427 ms
103,852 KB
testcase_53 AC 835 ms
140,088 KB
testcase_54 AC 948 ms
150,328 KB
testcase_55 AC 851 ms
138,604 KB
testcase_56 AC 543 ms
110,508 KB
testcase_57 AC 1,109 ms
152,076 KB
testcase_58 AC 1,111 ms
152,964 KB
testcase_59 AC 1,120 ms
153,100 KB
testcase_60 AC 1,129 ms
152,468 KB
testcase_61 AC 66 ms
67,840 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right, insort
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')

class SortedMultiset(Generic[T]):
    BUCKET_RATIO = 50
    REBUILD_RATIO = 170

    def _build(self, a=None) -> None:
        "Evenly divide `a` into buckets."
        if a is None: a = list(self)
        size = self.size = len(a)
        bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
        self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
    
    def __init__(self, a: Iterable[T] = []) -> None:
        "Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
        a = list(a)
        if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
            a = sorted(a)
        self._build(a)

    def __iter__(self) -> Iterator[T]:
        for i in self.a:
            for j in i: yield j

    def __reversed__(self) -> Iterator[T]:
        for i in reversed(self.a):
            for j in reversed(i): yield j
    
    def __len__(self) -> int:
        return self.size
    
    def __repr__(self) -> str:
        return "SortedMultiset" + str(self.a)
    
    def __str__(self) -> str:
        s = str(list(self))
        return "{" + s[1 : len(s) - 1] + "}"

    def _find_bucket(self, x: T) -> List[T]:
        "Find the bucket which should contain x. self must not be empty."
        for a in self.a:
            if x <= a[-1]: return a
        return a

    def __contains__(self, x: T) -> bool:
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        return i != len(a) and a[i] == x

    def count(self, x: T) -> int:
        "Count the number of x."
        return self.index_right(x) - self.index(x)

    def add(self, x: T) -> None:
        "Add an element. / O(√N)"
        if self.size == 0:
            self.a = [[x]]
            self.size = 1
            return
        a = self._find_bucket(x)
        insort(a, x)
        self.size += 1
        if len(a) > len(self.a) * self.REBUILD_RATIO:
            self._build()

    def discard(self, x: T) -> bool:
        "Remove an element and return True if removed. / O(√N)"
        if self.size == 0: return False
        a = self._find_bucket(x)
        i = bisect_left(a, x)
        if i == len(a) or a[i] != x: return False
        a.pop(i)
        self.size -= 1
        if len(a) == 0: self._build()
        return True

    def lt(self, x: T) -> Union[T, None]:
        "Find the largest element < x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] < x:
                return a[bisect_left(a, x) - 1]

    def le(self, x: T) -> Union[T, None]:
        "Find the largest element <= x, or None if it doesn't exist."
        for a in reversed(self.a):
            if a[0] <= x:
                return a[bisect_right(a, x) - 1]

    def gt(self, x: T) -> Union[T, None]:
        "Find the smallest element > x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] > x:
                return a[bisect_right(a, x)]

    def ge(self, x: T) -> Union[T, None]:
        "Find the smallest element >= x, or None if it doesn't exist."
        for a in self.a:
            if a[-1] >= x:
                return a[bisect_left(a, x)]
    
    def __getitem__(self, x: int) -> T:
        "Return the x-th element, or IndexError if it doesn't exist."
        if x < 0: x += self.size
        if x < 0: raise IndexError
        for a in self.a:
            if x < len(a): return a[x]
            x -= len(a)
        raise IndexError

    def index(self, x: T) -> int:
        "Count the number of elements < x."
        ans = 0
        for a in self.a:
            if a[-1] >= x:
                return ans + bisect_left(a, x)
            ans += len(a)
        return ans

    def index_right(self, x: T) -> int:
        "Count the number of elements <= x."
        ans = 0
        for a in self.a:
            if a[-1] > x:
                return ans + bisect_right(a, x)
            ans += len(a)
        return ans
N,M = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
normal = []
mma = []
for i in range(M):
    T,C = map(int,input().split())
    if T:
        mma.append(C)
    else:
        normal.append(C)
mma.sort()
st = SortedMultiset()
now = 0
mmaprice = [(B[i],A[i],i)for i in range(N)]
mmaprice.sort()
canbuy = []
import heapq
alreadybuy = set()
ans = 0
for x in mma:
    while now != N and mmaprice[now][0] <= x:
        heapq.heappush(canbuy,(-mmaprice[now][1],mmaprice[now][2]))
        now += 1
    if len(canbuy) != 0:
        _,i = heapq.heappop(canbuy)
        alreadybuy.add(i)
        ans += 1
nokori = []
for i in range(N):
    if i not in alreadybuy:
        nokori.append(A[i])
canbuy = []
nokori.sort()
now = 0
normal.sort()
for x in normal:
    while now != len(nokori) and nokori[now] <= x:
        heapq.heappush(canbuy,nokori[now])
        now += 1
    if len(canbuy) != 0:
        heapq.heappop(canbuy)
        ans += 1
print(N-ans)
0