結果
問題 | No.512 魔法少女の追いかけっこ |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 11:54:00 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,620 bytes |
コンパイル時間 | 315 ms |
コンパイル使用メモリ | 82,340 KB |
実行使用メモリ | 89,992 KB |
最終ジャッジ日時 | 2024-10-07 04:05:56 |
合計ジャッジ時間 | 9,853 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 157 ms
89,600 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 149 ms
89,552 KB |
testcase_07 | AC | 150 ms
89,528 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 148 ms
89,728 KB |
testcase_11 | WA | - |
testcase_12 | AC | 146 ms
89,728 KB |
testcase_13 | AC | 144 ms
89,088 KB |
testcase_14 | AC | 146 ms
89,572 KB |
testcase_15 | WA | - |
testcase_16 | AC | 146 ms
89,408 KB |
testcase_17 | AC | 149 ms
89,576 KB |
testcase_18 | AC | 148 ms
89,472 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 145 ms
89,472 KB |
testcase_22 | AC | 151 ms
89,600 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 145 ms
89,568 KB |
testcase_27 | AC | 148 ms
89,292 KB |
testcase_28 | AC | 150 ms
89,600 KB |
testcase_29 | AC | 144 ms
89,216 KB |
testcase_30 | AC | 144 ms
89,216 KB |
testcase_31 | AC | 150 ms
89,600 KB |
testcase_32 | AC | 145 ms
89,472 KB |
testcase_33 | AC | 149 ms
89,600 KB |
testcase_34 | AC | 155 ms
89,728 KB |
testcase_35 | AC | 146 ms
89,200 KB |
testcase_36 | WA | - |
testcase_37 | AC | 149 ms
89,588 KB |
testcase_38 | AC | 148 ms
89,216 KB |
testcase_39 | AC | 147 ms
89,588 KB |
testcase_40 | AC | 150 ms
89,288 KB |
testcase_41 | AC | 151 ms
89,600 KB |
testcase_42 | AC | 150 ms
89,640 KB |
testcase_43 | WA | - |
testcase_44 | AC | 150 ms
89,216 KB |
testcase_45 | AC | 149 ms
89,556 KB |
testcase_46 | AC | 148 ms
89,168 KB |
testcase_47 | WA | - |
testcase_48 | AC | 148 ms
89,600 KB |
testcase_49 | AC | 149 ms
89,600 KB |
testcase_50 | AC | 145 ms
89,600 KB |
testcase_51 | WA | - |
testcase_52 | 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(): X, Y = i_map() X *= 1000 Y *= 1000 X /= 3600 Y /= 3600 N = int(input()) A = i_list() for i in range(N-1): a, b = A[i], A[i+1] p = a / X pp = p * Y if pp >= b: print('NO') exit() print('YES') if __name__ == '__main__': main()