#902809 (PyPy3) No.2422 regisys?

提出ソース

結果

問題	No.2422 regisys?
ユーザー	とりゐ
提出日時	2023-08-12 14:58:02
言語	PyPy3 (7.3.15)
結果	AC
実行時間	904 ms / 2,000 ms
コード長	4,827 bytes
コンパイル時間	293 ms
コンパイル使用メモリ	82,424 KB
実行使用メモリ	142,380 KB
最終ジャッジ日時	2024-04-30 07:40:12
合計ジャッジ時間	20,733 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	59 ms 69,320 KB
testcase_01	AC	60 ms 68,596 KB
testcase_02	AC	61 ms 70,180 KB
testcase_03	AC	57 ms 69,300 KB
testcase_04	AC	58 ms 70,132 KB
testcase_05	AC	58 ms 69,076 KB
testcase_06	AC	59 ms 69,716 KB
testcase_07	AC	57 ms 69,452 KB
testcase_08	AC	59 ms 69,360 KB
testcase_09	AC	58 ms 69,388 KB
testcase_10	AC	59 ms 69,340 KB
testcase_11	AC	58 ms 69,768 KB
testcase_12	AC	56 ms 68,920 KB
testcase_13	AC	58 ms 70,668 KB
testcase_14	AC	59 ms 69,060 KB
testcase_15	AC	57 ms 70,168 KB
testcase_16	AC	56 ms 69,128 KB
testcase_17	AC	57 ms 69,520 KB
testcase_18	AC	56 ms 69,624 KB
testcase_19	AC	59 ms 70,356 KB
testcase_20	AC	57 ms 69,772 KB
testcase_21	AC	60 ms 69,724 KB
testcase_22	AC	60 ms 68,648 KB
testcase_23	AC	60 ms 69,568 KB
testcase_24	AC	57 ms 69,120 KB
testcase_25	AC	57 ms 68,856 KB
testcase_26	AC	55 ms 68,424 KB
testcase_27	AC	55 ms 68,980 KB
testcase_28	AC	56 ms 69,232 KB
testcase_29	AC	55 ms 69,260 KB
testcase_30	AC	56 ms 68,924 KB
testcase_31	AC	347 ms 98,196 KB
testcase_32	AC	366 ms 95,068 KB
testcase_33	AC	352 ms 98,592 KB
testcase_34	AC	209 ms 84,284 KB
testcase_35	AC	415 ms 107,632 KB
testcase_36	AC	272 ms 87,868 KB
testcase_37	AC	414 ms 98,436 KB
testcase_38	AC	237 ms 89,160 KB
testcase_39	AC	193 ms 85,536 KB
testcase_40	AC	265 ms 87,964 KB
testcase_41	AC	229 ms 87,376 KB
testcase_42	AC	661 ms 139,432 KB
testcase_43	AC	335 ms 93,864 KB
testcase_44	AC	699 ms 140,060 KB
testcase_45	AC	593 ms 128,428 KB
testcase_46	AC	689 ms 140,420 KB
testcase_47	AC	435 ms 104,216 KB
testcase_48	AC	736 ms 141,116 KB
testcase_49	AC	506 ms 113,972 KB
testcase_50	AC	710 ms 139,612 KB
testcase_51	AC	801 ms 139,884 KB
testcase_52	AC	379 ms 104,112 KB
testcase_53	AC	723 ms 140,028 KB
testcase_54	AC	816 ms 142,380 KB
testcase_55	AC	712 ms 136,788 KB
testcase_56	AC	458 ms 108,900 KB
testcase_57	AC	876 ms 141,592 KB
testcase_58	AC	904 ms 141,332 KB
testcase_59	AC	876 ms 140,832 KB
testcase_60	AC	853 ms 141,092 KB
testcase_61	AC	58 ms 69,292 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

from sys import stdin
input=lambda :stdin.readline()[:-1]

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()))
t0=[]
t1=[]
for i in range(m):
  t,c=map(int,input().split())
  if t:
    t1.append(c)
  else:
    t0.append(c)

t0.sort()
t1.sort()

from heapq import heappop, heappush
ab=[]
for i in range(n):
  ab.append([a[i],b[i]])

ab.sort()
idx=0
hq=[]
ans=0
for c in t0:
  while idx!=n and ab[idx][0]<=c:
    heappush(hq,-ab[idx][1])
    idx+=1
  if hq:
    ans+=1
    heappop(hq)

for i in range(idx,n):
  heappush(hq,-ab[i][1])

hq2=[]
for i in hq:
  heappush(hq2,-i)

for c in t1:
  if hq2 and hq2[0]<=c:
    heappop(hq2)
    ans+=1
print(n-ans)

yukicoder

結果

テストケース

ソースコード