結果
| 問題 | No.2869 yuusaan's Knapsacks |
| ユーザー |
 miya145592
|
| 提出日時 | 2024-08-30 23:03:25 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,110 bytes |
| コンパイル時間 | 278 ms |
| コンパイル使用メモリ | 82,320 KB |
| 実行使用メモリ | 85,756 KB |
| 最終ジャッジ日時 | 2024-08-30 23:03:42 |
| 合計ジャッジ時間 | 16,643 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 64 ms
69,656 KB |
| testcase_01 | AC | 62 ms
69,160 KB |
| testcase_02 | AC | 65 ms
70,032 KB |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | AC | 61 ms
68,244 KB |
| testcase_06 | AC | 421 ms
79,532 KB |
| testcase_07 | AC | 543 ms
82,940 KB |
| testcase_08 | AC | 202 ms
80,008 KB |
| testcase_09 | AC | 196 ms
79,936 KB |
| testcase_10 | AC | 643 ms
80,524 KB |
| testcase_11 | WA | - |
| testcase_12 | AC | 780 ms
79,848 KB |
| testcase_13 | AC | 384 ms
80,668 KB |
| testcase_14 | WA | - |
| testcase_15 | AC | 491 ms
81,700 KB |
| testcase_16 | WA | - |
| testcase_17 | AC | 976 ms
80,752 KB |
| testcase_18 | AC | 777 ms
81,136 KB |
| testcase_19 | AC | 670 ms
80,912 KB |
| testcase_20 | AC | 187 ms
79,960 KB |
| testcase_21 | AC | 743 ms
80,360 KB |
| testcase_22 | AC | 698 ms
80,680 KB |
| testcase_23 | AC | 371 ms
80,860 KB |
| testcase_24 | AC | 818 ms
81,164 KB |
| testcase_25 | WA | - |
| testcase_26 | AC | 650 ms
79,644 KB |
| testcase_27 | AC | 61 ms
68,060 KB |
| testcase_28 | AC | 528 ms
80,456 KB |
| testcase_29 | AC | 423 ms
79,244 KB |
ソースコード
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
class SortedSet(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 SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(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 "SortedSet" + 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 add(self, x: T) -> bool:
"Add an element and return True if added. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a = self._find_bucket(x)
i = bisect_left(a, x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
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
import sys
input = sys.stdin.readline
N, M = map(int, input().split())
E = list(map(int, input().split()))
VW = [list(map(int, input().split())) for _ in range(M)]
for i in range(N):
e = E[i]
E[i] = (e, i)
for i in range(M):
v, w = VW[i]
VW[i] = (v, w, i)
VW.sort(key=lambda x:-x[1])
ans = 0
ans2 = [[] for _ in range(N)]
for i in range(1<<M):
S = SortedSet(E)
flag = True
tmp = 0
tmp2 = [[] for _ in range(N)]
for j in range(M):
if (i>>j)&1:
v, w, jj = VW[j]
x = S.ge((w, 0))
if x is None:
flag = False
break
ee, ii = x
tmp+=v
tmp2[ii].append(jj+1)
S.discard(x)
S.add((ee-w, ii))
if flag:
if ans<tmp:
ans = tmp
ans2 = tmp2
print(ans)
for i in range(N):
print(len(ans2[i]), *ans2[i])