結果
問題 | No.2056 非力なレッド |
ユーザー | McGregorsh |
提出日時 | 2022-08-26 22:02:37 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,771 bytes |
コンパイル時間 | 347 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 123,392 KB |
最終ジャッジ日時 | 2024-04-22 00:08:01 |
合計ジャッジ時間 | 9,466 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
89,472 KB |
testcase_01 | AC | 136 ms
89,472 KB |
testcase_02 | AC | 139 ms
89,600 KB |
testcase_03 | AC | 137 ms
89,472 KB |
testcase_04 | AC | 137 ms
89,088 KB |
testcase_05 | AC | 137 ms
89,088 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 137 ms
89,728 KB |
testcase_09 | AC | 138 ms
89,344 KB |
testcase_10 | WA | - |
testcase_11 | AC | 140 ms
89,472 KB |
testcase_12 | WA | - |
testcase_13 | AC | 185 ms
109,184 KB |
testcase_14 | AC | 173 ms
109,056 KB |
testcase_15 | AC | 175 ms
109,184 KB |
testcase_16 | AC | 142 ms
89,984 KB |
testcase_17 | AC | 166 ms
102,144 KB |
testcase_18 | AC | 144 ms
90,368 KB |
testcase_19 | AC | 144 ms
90,368 KB |
testcase_20 | AC | 166 ms
114,688 KB |
testcase_21 | AC | 152 ms
92,032 KB |
testcase_22 | AC | 170 ms
109,184 KB |
testcase_23 | WA | - |
testcase_24 | AC | 149 ms
96,512 KB |
testcase_25 | AC | 173 ms
115,072 KB |
testcase_26 | AC | 209 ms
118,400 KB |
testcase_27 | AC | 201 ms
115,200 KB |
testcase_28 | AC | 214 ms
123,264 KB |
testcase_29 | AC | 212 ms
123,392 KB |
testcase_30 | AC | 188 ms
123,136 KB |
testcase_31 | AC | 179 ms
123,008 KB |
testcase_32 | AC | 178 ms
122,496 KB |
testcase_33 | AC | 185 ms
123,392 KB |
testcase_34 | WA | - |
testcase_35 | AC | 178 ms
123,008 KB |
testcase_36 | AC | 175 ms
122,880 KB |
testcase_37 | WA | - |
testcase_38 | AC | 139 ms
89,472 KB |
testcase_39 | AC | 140 ms
89,344 KB |
testcase_40 | 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, 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 main(): N, X, M = i_map() A = i_list() A = A[::-1] cou = 0 cou2 = 0 for i in range(N): if A[i] >= X: cost = 0 while A[i] >= X: point = floor(A[i] / 2) A[i] = point cost += 1 if cou < cost: cou = cost cou2 += (N - i) if cou2 > M: print('No') else: print('Yes') if __name__ == '__main__': main()