結果

問題 No.2161 Black Market
ユーザー mkawa2mkawa2
提出日時 2022-12-12 02:26:44
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 2,690 ms / 7,000 ms
コード長 5,700 bytes
コンパイル時間 336 ms
コンパイル使用メモリ 82,376 KB
実行使用メモリ 237,104 KB
最終ジャッジ日時 2024-11-06 02:42:47
合計ジャッジ時間 19,629 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
68,388 KB
testcase_01 AC 64 ms
69,040 KB
testcase_02 AC 73 ms
71,476 KB
testcase_03 AC 65 ms
69,776 KB
testcase_04 AC 68 ms
68,920 KB
testcase_05 AC 65 ms
68,800 KB
testcase_06 AC 69 ms
70,416 KB
testcase_07 AC 102 ms
78,664 KB
testcase_08 AC 99 ms
78,660 KB
testcase_09 AC 96 ms
78,744 KB
testcase_10 AC 101 ms
78,492 KB
testcase_11 AC 88 ms
78,164 KB
testcase_12 AC 66 ms
70,840 KB
testcase_13 AC 67 ms
69,804 KB
testcase_14 AC 66 ms
69,632 KB
testcase_15 AC 106 ms
78,800 KB
testcase_16 AC 75 ms
74,196 KB
testcase_17 AC 64 ms
68,192 KB
testcase_18 AC 63 ms
68,180 KB
testcase_19 AC 64 ms
69,192 KB
testcase_20 AC 1,691 ms
226,240 KB
testcase_21 AC 1,683 ms
230,332 KB
testcase_22 AC 2,690 ms
213,780 KB
testcase_23 AC 1,682 ms
237,104 KB
testcase_24 AC 2,169 ms
210,960 KB
testcase_25 AC 611 ms
105,900 KB
testcase_26 AC 1,956 ms
188,688 KB
testcase_27 AC 128 ms
89,760 KB
testcase_28 AC 165 ms
90,600 KB
testcase_29 AC 152 ms
81,356 KB
testcase_30 AC 190 ms
80,700 KB
testcase_31 AC 1,331 ms
158,000 KB
testcase_32 AC 86 ms
83,580 KB
testcase_33 AC 289 ms
82,920 KB
testcase_34 AC 135 ms
80,896 KB
testcase_35 AC 79 ms
79,580 KB
testcase_36 AC 218 ms
81,408 KB
testcase_37 AC 241 ms
81,104 KB
testcase_38 AC 829 ms
118,812 KB
testcase_39 AC 178 ms
80,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

# Thanks for tatyam
# 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

def mim(pre):
    n = len(pre)
    res = [[] for _ in range(n+1)]
    res[0].append((0, 0))
    for i, (a, b) in enumerate(pre):
        for j in range(i+1)[::-1]:
            for c, d in res[j]:
                res[j+1].append((a+c, b+d))
    return res

n, k, l, p = LI()
ab = LLI(n)

pre = ab[:n//2]
pos = ab[n//2:]
pre = mim(pre)
pos = mim(pos)
# pDB(pre)
# pDB(pos)

ans = 0
y = 0
cur = []
for x in range(min(k+1, len(pre)))[::-1]:
    while y < len(pos) and x+y <= k:
        cur += pos[y]
        y += 1
    if not cur: continue
    cur.sort(key=lambda x: x[1])
    ss = SortedMultiset()
    i = len(cur)-1
    for a, b in sorted(pre[x], key=lambda x: x[1]):
        while i >= 0 and cur[i][-1]+b >= p:
            ss.add(cur[i][0])
            i -= 1
        ans += ss.index_right(l-a)

print(ans)
0