結果
問題 | No.1071 ベホマラー |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 00:08:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 614 ms / 2,000 ms |
コード長 | 2,207 bytes |
コンパイル時間 | 505 ms |
コンパイル使用メモリ | 86,936 KB |
実行使用メモリ | 108,936 KB |
最終ジャッジ日時 | 2023-08-22 01:21:29 |
合計ジャッジ時間 | 12,553 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 237 ms
92,468 KB |
testcase_01 | AC | 236 ms
92,416 KB |
testcase_02 | AC | 235 ms
92,508 KB |
testcase_03 | AC | 236 ms
92,200 KB |
testcase_04 | AC | 249 ms
93,224 KB |
testcase_05 | AC | 240 ms
92,992 KB |
testcase_06 | AC | 240 ms
92,848 KB |
testcase_07 | AC | 239 ms
92,580 KB |
testcase_08 | AC | 240 ms
92,628 KB |
testcase_09 | AC | 237 ms
92,468 KB |
testcase_10 | AC | 298 ms
106,376 KB |
testcase_11 | AC | 294 ms
104,716 KB |
testcase_12 | AC | 282 ms
100,404 KB |
testcase_13 | AC | 450 ms
103,364 KB |
testcase_14 | AC | 318 ms
106,496 KB |
testcase_15 | AC | 332 ms
108,360 KB |
testcase_16 | AC | 318 ms
108,328 KB |
testcase_17 | AC | 546 ms
108,168 KB |
testcase_18 | AC | 596 ms
108,348 KB |
testcase_19 | AC | 520 ms
108,568 KB |
testcase_20 | AC | 614 ms
108,812 KB |
testcase_21 | AC | 365 ms
108,936 KB |
testcase_22 | AC | 598 ms
108,676 KB |
testcase_23 | AC | 561 ms
108,840 KB |
testcase_24 | AC | 380 ms
108,272 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def threeserch(K, X, Y, A, N): # 関数 def solve(c, K, X, Y): p = c * K + 1 cou = c * Y for i in range(N): if A[i] > p: cost = int(ceil((A[i] - p) / K)) * X cou += cost return cou l = 0 r = 10 ** 18 while l + 2 < r: c1 = l + (r - l) // 3 c2 = r - (r - l) // 3 if solve(c1, K, X, Y) < solve(c2, K, X, Y): r = c2 else: l = c1 return l, r def main(): def solve(c, K, X, Y): p = c * K + 1 cou = c * Y for i in range(N): if A[i] > p: cost = int(ceil((A[i] - p) / K)) * X cou += cost return cou N, K, X, Y = i_map() A = i_list() l, r = threeserch(K, X, Y, A, N) ans = INF for i in range(l, r+1): ans = min(ans, solve(i, K, X, Y)) print(ans) if __name__ == '__main__': main()