結果
問題 | No.1944 ∞ |
ユーザー | McGregorsh |
提出日時 | 2023-05-22 22:16:31 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,580 bytes |
コンパイル時間 | 285 ms |
コンパイル使用メモリ | 87,132 KB |
実行使用メモリ | 120,972 KB |
最終ジャッジ日時 | 2023-08-24 03:25:11 |
合計ジャッジ時間 | 10,245 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 221 ms
92,388 KB |
testcase_01 | AC | 223 ms
92,368 KB |
testcase_02 | AC | 219 ms
92,300 KB |
testcase_03 | AC | 223 ms
92,284 KB |
testcase_04 | AC | 224 ms
92,388 KB |
testcase_05 | AC | 232 ms
92,196 KB |
testcase_06 | AC | 224 ms
92,272 KB |
testcase_07 | AC | 224 ms
92,380 KB |
testcase_08 | AC | 223 ms
92,468 KB |
testcase_09 | AC | 226 ms
92,276 KB |
testcase_10 | AC | 226 ms
92,248 KB |
testcase_11 | AC | 225 ms
92,396 KB |
testcase_12 | AC | 228 ms
92,464 KB |
testcase_13 | AC | 230 ms
92,460 KB |
testcase_14 | WA | - |
testcase_15 | AC | 269 ms
116,380 KB |
testcase_16 | AC | 234 ms
93,124 KB |
testcase_17 | AC | 237 ms
93,092 KB |
testcase_18 | AC | 235 ms
93,156 KB |
testcase_19 | AC | 238 ms
93,084 KB |
testcase_20 | AC | 237 ms
93,124 KB |
testcase_21 | AC | 233 ms
93,144 KB |
testcase_22 | AC | 231 ms
93,152 KB |
testcase_23 | AC | 235 ms
93,036 KB |
testcase_24 | AC | 239 ms
93,056 KB |
testcase_25 | AC | 233 ms
93,160 KB |
testcase_26 | AC | 239 ms
93,228 KB |
testcase_27 | AC | 237 ms
93,248 KB |
testcase_28 | AC | 236 ms
93,132 KB |
testcase_29 | AC | 231 ms
92,904 KB |
testcase_30 | AC | 233 ms
93,028 KB |
testcase_31 | AC | 231 ms
93,224 KB |
testcase_32 | AC | 229 ms
93,172 KB |
testcase_33 | AC | 257 ms
120,756 KB |
testcase_34 | AC | 261 ms
120,972 KB |
testcase_35 | AC | 257 ms
120,888 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, 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 = (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() total = sum(R) * 2 p = get_distance(0, 0, X, Y) for i in range(N): nokori = total - R[i] if R[i] ** 2 <= p <= nokori ** 2: print('Yes') exit() print('No') if __name__ == '__main__': main()