結果
| 問題 | No.2408 Lakes and Fish |
| ユーザー |
 hato336
|
| 提出日時 | 2023-08-11 21:27:08 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 600 ms / 2,000 ms |
| コード長 | 5,367 bytes |
| コンパイル時間 | 363 ms |
| コンパイル使用メモリ | 82,792 KB |
| 実行使用メモリ | 111,044 KB |
| 最終ジャッジ日時 | 2024-11-18 15:24:27 |
| 合計ジャッジ時間 | 9,573 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 147 ms
88,948 KB |
| testcase_01 | AC | 142 ms
89,076 KB |
| testcase_02 | AC | 140 ms
88,744 KB |
| testcase_03 | AC | 139 ms
88,804 KB |
| testcase_04 | AC | 407 ms
110,412 KB |
| testcase_05 | AC | 407 ms
110,532 KB |
| testcase_06 | AC | 600 ms
111,044 KB |
| testcase_07 | AC | 476 ms
109,668 KB |
| testcase_08 | AC | 472 ms
109,664 KB |
| testcase_09 | AC | 457 ms
109,532 KB |
| testcase_10 | AC | 481 ms
109,280 KB |
| testcase_11 | AC | 337 ms
99,752 KB |
| testcase_12 | AC | 398 ms
104,356 KB |
| testcase_13 | AC | 253 ms
93,496 KB |
| testcase_14 | AC | 307 ms
97,612 KB |
| testcase_15 | AC | 412 ms
105,168 KB |
| testcase_16 | AC | 278 ms
95,952 KB |
| testcase_17 | AC | 272 ms
94,784 KB |
| testcase_18 | AC | 328 ms
98,996 KB |
| testcase_19 | AC | 385 ms
103,592 KB |
| testcase_20 | AC | 375 ms
103,744 KB |
| testcase_21 | AC | 413 ms
104,708 KB |
ソースコード
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(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)
self.size = len(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 __eq__(self, other) -> bool:
return list(self) == list(other)
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 _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(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, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"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) -> Optional[T]:
"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) -> Optional[T]:
"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) -> Optional[T]:
"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, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= 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())
llist = list(map(int,input().split()))
fish = []
sms = SortedMultiset()
for i in llist:
sms.add(i)
sms.add(-10**18)
sms.add(10**18)
for i in range(m):
fish.append(list(map(int,input().split())))
ans = 0
for f,b,w in fish:
temp = min(abs(f-sms.ge(f)),abs(f-sms.le(f)))
ans += max(b,w-temp)
print(ans)