結果

問題 No.2161 Black Market
ユーザー titiatitia
提出日時 2022-12-12 02:57:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,500 ms / 7,000 ms
コード長 5,484 bytes
コンパイル時間 296 ms
コンパイル使用メモリ 82,532 KB
実行使用メモリ 237,016 KB
最終ジャッジ日時 2024-04-23 20:49:50
合計ジャッジ時間 16,115 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 66 ms
67,712 KB
testcase_01 AC 65 ms
67,712 KB
testcase_02 AC 93 ms
78,336 KB
testcase_03 AC 39 ms
53,248 KB
testcase_04 AC 38 ms
53,376 KB
testcase_05 AC 39 ms
53,760 KB
testcase_06 AC 109 ms
78,720 KB
testcase_07 AC 112 ms
78,592 KB
testcase_08 AC 111 ms
79,024 KB
testcase_09 AC 96 ms
78,464 KB
testcase_10 AC 120 ms
79,488 KB
testcase_11 AC 104 ms
78,848 KB
testcase_12 AC 91 ms
78,208 KB
testcase_13 AC 65 ms
68,480 KB
testcase_14 AC 67 ms
69,120 KB
testcase_15 AC 122 ms
79,552 KB
testcase_16 AC 78 ms
73,984 KB
testcase_17 AC 66 ms
68,224 KB
testcase_18 AC 39 ms
53,632 KB
testcase_19 AC 78 ms
73,472 KB
testcase_20 AC 1,521 ms
230,752 KB
testcase_21 AC 1,477 ms
230,764 KB
testcase_22 AC 268 ms
83,968 KB
testcase_23 AC 1,760 ms
237,016 KB
testcase_24 AC 2,500 ms
210,240 KB
testcase_25 AC 628 ms
102,332 KB
testcase_26 AC 1,936 ms
194,688 KB
testcase_27 AC 202 ms
80,000 KB
testcase_28 AC 215 ms
80,320 KB
testcase_29 AC 178 ms
80,420 KB
testcase_30 AC 211 ms
80,660 KB
testcase_31 AC 1,313 ms
154,892 KB
testcase_32 AC 137 ms
78,464 KB
testcase_33 AC 296 ms
83,968 KB
testcase_34 AC 92 ms
77,952 KB
testcase_35 AC 94 ms
78,464 KB
testcase_36 AC 81 ms
74,624 KB
testcase_37 AC 91 ms
78,464 KB
testcase_38 AC 116 ms
77,952 KB
testcase_39 AC 82 ms
74,624 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline
from operator import itemgetter

N,K,L,P=map(int,input().split())

AB=[tuple(map(int,input().split())) for i in range(N)]

if N==1:
    a,b=AB[0]
    if a<=L and b>=P:
        print(1)
    else:
        print(0)

    exit()

# 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

AB0=AB[:N//2]
AB1=AB[N//2:]

X=[[] for i in range(K+1)]

for i in range(1<<(len(AB0))):
    cost=0
    value=0
    mai=0
    for j in range(len(AB0)):
        if i & (1<<j) != 0:
            cost+=AB0[j][0]
            value+=AB0[j][1]
            mai+=1

    if cost<=L and mai<=K:
        X[mai].append((cost,value))

Y=[[] for i in range(K+1)]

for i in range(1<<(len(AB1))):
    cost=0
    value=0
    mai=0
    for j in range(len(AB1)):
        if i & (1<<j) != 0:
            cost+=AB1[j][0]
            value+=AB1[j][1]
            mai+=1

    if cost<=L and mai<=K:
        Y[mai].append((cost,value))

ANS=0

Z=[]

for i in range(K,-1,-1):
    Z+=Y[K-i]

    if X[i]==[]:
        continue

    S=SortedMultiset()

    X[i].sort(key=itemgetter(0),reverse=True)
    Z.sort(key=itemgetter(0))

    ind=0
    count=0

    for c,v in X[i]:
        while ind<len(Z) and c+Z[ind][0]<=L:
            S.add(Z[ind][1])
            ind+=1
            count+=1

        u=P-v

        ANS+=count-S.index(u)

print(ANS)
0