結果
問題 | No.1736 Princess vs. Dragoness |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 12:58:57 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,886 bytes |
コンパイル時間 | 922 ms |
コンパイル使用メモリ | 86,816 KB |
実行使用メモリ | 93,352 KB |
最終ジャッジ日時 | 2023-09-23 05:39:13 |
合計ジャッジ時間 | 12,777 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
92,120 KB |
testcase_01 | AC | 249 ms
92,008 KB |
testcase_02 | AC | 250 ms
92,052 KB |
testcase_03 | AC | 257 ms
92,112 KB |
testcase_04 | WA | - |
testcase_05 | AC | 247 ms
92,236 KB |
testcase_06 | AC | 255 ms
93,260 KB |
testcase_07 | AC | 257 ms
93,160 KB |
testcase_08 | AC | 257 ms
93,172 KB |
testcase_09 | AC | 258 ms
93,096 KB |
testcase_10 | AC | 253 ms
92,036 KB |
testcase_11 | AC | 251 ms
93,060 KB |
testcase_12 | AC | 256 ms
93,196 KB |
testcase_13 | WA | - |
testcase_14 | AC | 262 ms
93,252 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 253 ms
93,156 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 252 ms
93,032 KB |
testcase_21 | AC | 249 ms
92,940 KB |
testcase_22 | AC | 263 ms
93,352 KB |
testcase_23 | AC | 251 ms
92,808 KB |
testcase_24 | AC | 250 ms
92,836 KB |
testcase_25 | AC | 249 ms
92,032 KB |
testcase_26 | AC | 254 ms
92,804 KB |
testcase_27 | AC | 255 ms
92,788 KB |
testcase_28 | AC | 253 ms
92,808 KB |
testcase_29 | AC | 252 ms
92,960 KB |
testcase_30 | AC | 258 ms
93,220 KB |
testcase_31 | WA | - |
testcase_32 | AC | 255 ms
92,808 KB |
testcase_33 | WA | - |
testcase_34 | AC | 252 ms
92,100 KB |
testcase_35 | WA | - |
ソースコード
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() point = 0 acou = 0 while point < N and acou <= B: num = Y acou += 1 for i in range(point, N): num1 = min(num, H[i]) H[i] -= num1 num -= num1 if num == 0: break else: point += 1 count = 0 for i in range(N): if H[i] % X == 0: count += H[i] // X else: count += H[i] // X + 1 if count > A: print('No') else: print('Yes') if __name__ == '__main__': main()