結果
問題 | No.1736 Princess vs. Dragoness |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 13:20:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 314 ms / 2,000 ms |
コード長 | 1,846 bytes |
コンパイル時間 | 748 ms |
コンパイル使用メモリ | 87,004 KB |
実行使用メモリ | 94,992 KB |
最終ジャッジ日時 | 2023-09-23 05:54:16 |
合計ジャッジ時間 | 12,906 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 262 ms
92,192 KB |
testcase_01 | AC | 259 ms
92,356 KB |
testcase_02 | AC | 260 ms
92,136 KB |
testcase_03 | AC | 271 ms
92,664 KB |
testcase_04 | AC | 296 ms
93,576 KB |
testcase_05 | AC | 264 ms
93,004 KB |
testcase_06 | AC | 293 ms
94,856 KB |
testcase_07 | AC | 314 ms
94,408 KB |
testcase_08 | AC | 307 ms
94,992 KB |
testcase_09 | AC | 306 ms
94,212 KB |
testcase_10 | AC | 268 ms
92,988 KB |
testcase_11 | AC | 314 ms
94,916 KB |
testcase_12 | AC | 282 ms
93,880 KB |
testcase_13 | AC | 287 ms
93,840 KB |
testcase_14 | AC | 286 ms
93,676 KB |
testcase_15 | AC | 273 ms
93,528 KB |
testcase_16 | AC | 288 ms
93,316 KB |
testcase_17 | AC | 296 ms
94,684 KB |
testcase_18 | AC | 285 ms
93,580 KB |
testcase_19 | AC | 282 ms
93,736 KB |
testcase_20 | AC | 266 ms
92,768 KB |
testcase_21 | AC | 306 ms
94,604 KB |
testcase_22 | AC | 313 ms
94,348 KB |
testcase_23 | AC | 284 ms
93,620 KB |
testcase_24 | AC | 265 ms
92,388 KB |
testcase_25 | AC | 308 ms
94,128 KB |
testcase_26 | AC | 294 ms
94,480 KB |
testcase_27 | AC | 283 ms
93,780 KB |
testcase_28 | AC | 280 ms
93,752 KB |
testcase_29 | AC | 279 ms
93,892 KB |
testcase_30 | AC | 286 ms
93,808 KB |
testcase_31 | AC | 300 ms
94,284 KB |
testcase_32 | AC | 299 ms
94,988 KB |
testcase_33 | AC | 259 ms
92,220 KB |
testcase_34 | AC | 263 ms
92,252 KB |
testcase_35 | AC | 265 ms
92,556 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 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 main(): N, A, B, X, Y = i_map() H = i_list() que = [] for i in range(N): heappush(que, -H[i]) for i in range(A): num = heappop(que) if num + X >= 0: num = INF heappush(que, num) else: num += X heappush(que, num) #print(que) ans = list(que) cou = 0 for i in range(N): if ans[i] != INF: cou += -ans[i] #print(cou) if cou > B * Y: print('No') else: print('Yes') if __name__ == '__main__': main()