結果
問題 | No.1205 Eye Drops |
ユーザー | McGregorsh |
提出日時 | 2023-05-04 12:55:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 320 ms / 2,000 ms |
コード長 | 1,571 bytes |
コンパイル時間 | 340 ms |
コンパイル使用メモリ | 87,040 KB |
実行使用メモリ | 93,936 KB |
最終ジャッジ日時 | 2023-08-14 10:14:06 |
合計ジャッジ時間 | 13,030 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,204 KB |
testcase_01 | AC | 243 ms
92,144 KB |
testcase_02 | AC | 255 ms
92,276 KB |
testcase_03 | AC | 244 ms
92,312 KB |
testcase_04 | AC | 241 ms
92,180 KB |
testcase_05 | AC | 238 ms
92,288 KB |
testcase_06 | AC | 238 ms
92,116 KB |
testcase_07 | AC | 235 ms
92,348 KB |
testcase_08 | AC | 240 ms
92,216 KB |
testcase_09 | AC | 241 ms
92,172 KB |
testcase_10 | AC | 241 ms
92,288 KB |
testcase_11 | AC | 246 ms
92,228 KB |
testcase_12 | AC | 243 ms
92,480 KB |
testcase_13 | AC | 243 ms
92,232 KB |
testcase_14 | AC | 243 ms
92,076 KB |
testcase_15 | AC | 241 ms
92,176 KB |
testcase_16 | AC | 242 ms
92,340 KB |
testcase_17 | AC | 240 ms
92,284 KB |
testcase_18 | AC | 241 ms
92,156 KB |
testcase_19 | AC | 246 ms
92,340 KB |
testcase_20 | AC | 256 ms
92,164 KB |
testcase_21 | AC | 241 ms
92,336 KB |
testcase_22 | AC | 248 ms
92,292 KB |
testcase_23 | AC | 247 ms
92,256 KB |
testcase_24 | AC | 245 ms
92,256 KB |
testcase_25 | AC | 246 ms
92,176 KB |
testcase_26 | AC | 249 ms
92,312 KB |
testcase_27 | AC | 242 ms
92,064 KB |
testcase_28 | AC | 249 ms
92,052 KB |
testcase_29 | AC | 244 ms
92,316 KB |
testcase_30 | AC | 248 ms
92,492 KB |
testcase_31 | AC | 242 ms
92,260 KB |
testcase_32 | AC | 243 ms
92,188 KB |
testcase_33 | AC | 245 ms
92,336 KB |
testcase_34 | AC | 243 ms
92,140 KB |
testcase_35 | AC | 244 ms
92,212 KB |
testcase_36 | AC | 241 ms
92,212 KB |
testcase_37 | AC | 320 ms
93,936 KB |
testcase_38 | AC | 231 ms
92,248 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, M = i_map() now = 0 nowp = 0 for i in range(M): t, p = i_map() if abs(nowp - p) <= t - now: nowp = p now = t else: print('No') exit() print('Yes') if __name__ == '__main__': main()