結果
問題 | No.1944 ∞ |
ユーザー | McGregorsh |
提出日時 | 2023-05-22 22:29:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 277 ms / 2,000 ms |
コード長 | 1,618 bytes |
コンパイル時間 | 594 ms |
コンパイル使用メモリ | 87,276 KB |
実行使用メモリ | 121,172 KB |
最終ジャッジ日時 | 2023-08-24 03:31:10 |
合計ジャッジ時間 | 11,127 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,440 KB |
testcase_01 | AC | 236 ms
92,592 KB |
testcase_02 | AC | 236 ms
92,376 KB |
testcase_03 | AC | 235 ms
92,496 KB |
testcase_04 | AC | 243 ms
92,456 KB |
testcase_05 | AC | 238 ms
92,356 KB |
testcase_06 | AC | 239 ms
92,324 KB |
testcase_07 | AC | 236 ms
92,648 KB |
testcase_08 | AC | 237 ms
92,580 KB |
testcase_09 | AC | 237 ms
92,604 KB |
testcase_10 | AC | 235 ms
92,620 KB |
testcase_11 | AC | 233 ms
92,632 KB |
testcase_12 | AC | 237 ms
92,564 KB |
testcase_13 | AC | 239 ms
92,364 KB |
testcase_14 | AC | 237 ms
92,480 KB |
testcase_15 | AC | 277 ms
116,148 KB |
testcase_16 | AC | 237 ms
93,180 KB |
testcase_17 | AC | 241 ms
93,564 KB |
testcase_18 | AC | 241 ms
93,104 KB |
testcase_19 | AC | 245 ms
93,080 KB |
testcase_20 | AC | 243 ms
93,436 KB |
testcase_21 | AC | 239 ms
93,228 KB |
testcase_22 | AC | 239 ms
93,000 KB |
testcase_23 | AC | 245 ms
93,540 KB |
testcase_24 | AC | 242 ms
93,572 KB |
testcase_25 | AC | 241 ms
93,612 KB |
testcase_26 | AC | 243 ms
93,368 KB |
testcase_27 | AC | 240 ms
93,524 KB |
testcase_28 | AC | 240 ms
93,244 KB |
testcase_29 | AC | 239 ms
92,992 KB |
testcase_30 | AC | 240 ms
93,580 KB |
testcase_31 | AC | 240 ms
93,584 KB |
testcase_32 | AC | 241 ms
93,300 KB |
testcase_33 | AC | 276 ms
120,836 KB |
testcase_34 | AC | 273 ms
120,992 KB |
testcase_35 | AC | 272 ms
121,172 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 = 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() total = sum(R) * 2 p = get_distance(0, 0, X, Y) for i in range(N): nokori = total - R[i] minp = nokori - R[i] if max(0, R[i] - minp) <= p <= nokori: print('Yes') exit() print('No') if __name__ == '__main__': main()