結果
問題 | No.1944 ∞ |
ユーザー | McGregorsh |
提出日時 | 2022-07-28 14:39:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,715 bytes |
コンパイル時間 | 638 ms |
コンパイル使用メモリ | 87,008 KB |
実行使用メモリ | 120,952 KB |
最終ジャッジ日時 | 2023-09-25 06:36:40 |
合計ジャッジ時間 | 10,840 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
92,344 KB |
testcase_01 | AC | 231 ms
92,176 KB |
testcase_02 | AC | 231 ms
92,396 KB |
testcase_03 | AC | 233 ms
92,228 KB |
testcase_04 | AC | 232 ms
92,124 KB |
testcase_05 | AC | 235 ms
92,340 KB |
testcase_06 | AC | 237 ms
92,216 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 234 ms
92,116 KB |
testcase_10 | WA | - |
testcase_11 | AC | 230 ms
92,476 KB |
testcase_12 | AC | 235 ms
92,148 KB |
testcase_13 | AC | 233 ms
92,168 KB |
testcase_14 | AC | 239 ms
92,364 KB |
testcase_15 | AC | 337 ms
116,256 KB |
testcase_16 | AC | 237 ms
93,048 KB |
testcase_17 | AC | 233 ms
93,224 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 233 ms
92,920 KB |
testcase_21 | WA | - |
testcase_22 | AC | 232 ms
93,020 KB |
testcase_23 | AC | 231 ms
93,128 KB |
testcase_24 | AC | 235 ms
92,884 KB |
testcase_25 | AC | 236 ms
93,032 KB |
testcase_26 | AC | 234 ms
93,012 KB |
testcase_27 | AC | 236 ms
93,168 KB |
testcase_28 | AC | 235 ms
92,944 KB |
testcase_29 | AC | 229 ms
93,052 KB |
testcase_30 | AC | 232 ms
93,284 KB |
testcase_31 | AC | 233 ms
93,036 KB |
testcase_32 | AC | 240 ms
93,032 KB |
testcase_33 | AC | 261 ms
120,780 KB |
testcase_34 | AC | 262 ms
120,952 KB |
testcase_35 | AC | 266 ms
120,776 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) if n == 1: if cost == R[0]**2: print('Yes') exit() else: print('No') exit() 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()