結果
問題 | No.1736 Princess vs. Dragoness |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 13:17:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,756 bytes |
コンパイル時間 | 1,005 ms |
コンパイル使用メモリ | 87,060 KB |
実行使用メモリ | 95,104 KB |
最終ジャッジ日時 | 2023-09-23 05:51:59 |
合計ジャッジ時間 | 11,776 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
92,268 KB |
testcase_01 | AC | 245 ms
92,336 KB |
testcase_02 | AC | 245 ms
92,352 KB |
testcase_03 | WA | - |
testcase_04 | AC | 267 ms
93,744 KB |
testcase_05 | AC | 253 ms
92,936 KB |
testcase_06 | AC | 275 ms
94,624 KB |
testcase_07 | AC | 293 ms
94,224 KB |
testcase_08 | AC | 292 ms
94,752 KB |
testcase_09 | AC | 291 ms
94,096 KB |
testcase_10 | AC | 250 ms
93,336 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 268 ms
93,728 KB |
testcase_14 | WA | - |
testcase_15 | AC | 258 ms
93,320 KB |
testcase_16 | AC | 267 ms
93,360 KB |
testcase_17 | WA | - |
testcase_18 | AC | 268 ms
93,828 KB |
testcase_19 | AC | 263 ms
93,552 KB |
testcase_20 | AC | 252 ms
92,908 KB |
testcase_21 | WA | - |
testcase_22 | AC | 291 ms
94,240 KB |
testcase_23 | AC | 262 ms
93,704 KB |
testcase_24 | AC | 248 ms
92,228 KB |
testcase_25 | AC | 284 ms
93,900 KB |
testcase_26 | AC | 273 ms
94,408 KB |
testcase_27 | AC | 265 ms
93,656 KB |
testcase_28 | AC | 261 ms
93,408 KB |
testcase_29 | AC | 261 ms
93,596 KB |
testcase_30 | AC | 268 ms
93,668 KB |
testcase_31 | AC | 292 ms
94,188 KB |
testcase_32 | AC | 281 ms
94,636 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 249 ms
92,316 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) if -sum(ans) > B * Y: print('No') else: print('Yes') if __name__ == '__main__': main()