結果
問題 | No.1048 Zero (Advanced) |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 23:26:43 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,521 bytes |
コンパイル時間 | 440 ms |
コンパイル使用メモリ | 87,264 KB |
実行使用メモリ | 92,692 KB |
最終ジャッジ日時 | 2023-08-22 00:51:40 |
合計ジャッジ時間 | 6,470 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
92,500 KB |
testcase_01 | AC | 240 ms
92,532 KB |
testcase_02 | AC | 240 ms
92,684 KB |
testcase_03 | AC | 237 ms
92,340 KB |
testcase_04 | AC | 238 ms
92,608 KB |
testcase_05 | AC | 239 ms
92,576 KB |
testcase_06 | AC | 239 ms
92,564 KB |
testcase_07 | AC | 237 ms
92,508 KB |
testcase_08 | AC | 242 ms
92,440 KB |
testcase_09 | AC | 243 ms
92,520 KB |
testcase_10 | AC | 240 ms
92,644 KB |
testcase_11 | AC | 239 ms
92,580 KB |
testcase_12 | AC | 237 ms
92,528 KB |
testcase_13 | AC | 240 ms
92,516 KB |
testcase_14 | AC | 238 ms
92,320 KB |
testcase_15 | AC | 237 ms
92,692 KB |
testcase_16 | WA | - |
testcase_17 | AC | 241 ms
92,344 KB |
testcase_18 | AC | 240 ms
92,672 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(): L, R, M, K = i_map() if K == 0: print('Yes') exit() if R * K - L * K >= M or L * K <= M <= R * K: print('Yes') else: print('No') if __name__ == '__main__': main()