結果
問題 | No.1944 ∞ |
ユーザー | McGregorsh |
提出日時 | 2022-07-28 14:23:31 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,588 bytes |
コンパイル時間 | 995 ms |
コンパイル使用メモリ | 86,896 KB |
実行使用メモリ | 121,072 KB |
最終ジャッジ日時 | 2023-09-25 06:16:32 |
合計ジャッジ時間 | 12,851 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
92,212 KB |
testcase_01 | AC | 253 ms
92,352 KB |
testcase_02 | AC | 260 ms
92,260 KB |
testcase_03 | WA | - |
testcase_04 | AC | 256 ms
92,444 KB |
testcase_05 | AC | 249 ms
92,364 KB |
testcase_06 | AC | 249 ms
92,280 KB |
testcase_07 | AC | 247 ms
92,200 KB |
testcase_08 | AC | 252 ms
92,528 KB |
testcase_09 | WA | - |
testcase_10 | AC | 250 ms
92,392 KB |
testcase_11 | AC | 246 ms
92,364 KB |
testcase_12 | AC | 255 ms
92,376 KB |
testcase_13 | AC | 246 ms
92,228 KB |
testcase_14 | AC | 250 ms
92,088 KB |
testcase_15 | AC | 312 ms
116,100 KB |
testcase_16 | AC | 254 ms
93,020 KB |
testcase_17 | AC | 253 ms
93,188 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 256 ms
93,156 KB |
testcase_21 | WA | - |
testcase_22 | AC | 249 ms
92,996 KB |
testcase_23 | AC | 254 ms
93,016 KB |
testcase_24 | AC | 248 ms
93,160 KB |
testcase_25 | AC | 254 ms
93,016 KB |
testcase_26 | AC | 249 ms
93,008 KB |
testcase_27 | AC | 255 ms
93,164 KB |
testcase_28 | AC | 248 ms
92,960 KB |
testcase_29 | AC | 255 ms
93,264 KB |
testcase_30 | AC | 251 ms
93,248 KB |
testcase_31 | AC | 253 ms
93,244 KB |
testcase_32 | AC | 254 ms
93,012 KB |
testcase_33 | AC | 291 ms
120,844 KB |
testcase_34 | AC | 283 ms
121,072 KB |
testcase_35 | AC | 275 ms
120,732 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, x, y = i_map() R = i_list() cost = get_distance(x, y, 0, 0) total = R[0] for i in range(1, n): total += R[i] * 2 if total >= cost: print('Yes') else: print('No') if __name__ == '__main__': main()