結果
問題 | No.2546 Many Arithmetic Sequences |
ユーザー | Shirotsume |
提出日時 | 2023-07-23 23:28:17 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,483 bytes |
コンパイル時間 | 187 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 144,536 KB |
最終ジャッジ日時 | 2023-11-25 01:26:18 |
合計ジャッジ時間 | 18,899 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
56,140 KB |
testcase_01 | AC | 49 ms
56,144 KB |
testcase_02 | AC | 75 ms
73,404 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 450 ms
128,044 KB |
testcase_15 | AC | 220 ms
92,872 KB |
testcase_16 | AC | 447 ms
121,428 KB |
testcase_17 | WA | - |
testcase_18 | AC | 381 ms
104,584 KB |
testcase_19 | WA | - |
testcase_20 | AC | 292 ms
100,660 KB |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 599 ms
143,608 KB |
testcase_29 | AC | 601 ms
143,380 KB |
testcase_30 | AC | 590 ms
143,376 KB |
testcase_31 | AC | 606 ms
143,608 KB |
testcase_32 | AC | 606 ms
143,376 KB |
testcase_33 | AC | 48 ms
56,144 KB |
testcase_34 | WA | - |
testcase_35 | AC | 48 ms
58,208 KB |
testcase_36 | AC | 511 ms
143,720 KB |
testcase_37 | RE | - |
ソースコード
import sys, time, random, heapq from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 #https://tjkendev.github.io/procon-library/python/convex_hull_trick/deque.html deq = deque() def check(f1, f2, f3): return (f2[0] - f1[0]) * (f3[1] - f2[1]) >= (f2[1] - f1[1]) * (f3[0] - f2[0]) def f(f1, x): return f1[0]*x + f1[1] # add f_i(x) = a*x + b def add_line(a, b): f1 = (a, b) while len(deq) >= 2 and check(deq[-2], deq[-1], f1): deq.pop() deq.append(f1) # min f_i(x) def query(x): while len(deq) >= 2 and f(deq[0], x) >= f(deq[1], x): deq.popleft() return f(deq[0], x) n, m = mi() AD = [li() for _ in range(n)] plus = [] minus = [] for a, d in AD: if d > 0: plus.append((a, d)) else: minus.append((a, d)) p = [-inf] * (m + 1) p[0] = 0 for a, d in plus: add_line(-d, -2 * a + d) if plus: for i in range(1, m + 1): p[i] = -query(i) * i // 2 q = [-inf] * (m + 1) q[0] = 0 H = [] for a, d in minus: heapq.heappush(H, (-a, d)) for i in range(1, m + 1): a, d = heapq.heappop(H) a = -a q[i] = q[i - 1] + a heapq.heappush(H, (-(a + d), d)) ans = -inf maxi = -1 for i in range(0, m + 1): if ans <= p[i] + q[m - i]: ans = max(ans, p[i] + q[m - i]) maxi = i print(ans) print(maxi, file=sys.stderr)