結果
問題 | No.1048 Zero (Advanced) |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 23:30:07 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,582 bytes |
コンパイル時間 | 443 ms |
コンパイル使用メモリ | 82,416 KB |
実行使用メモリ | 89,768 KB |
最終ジャッジ日時 | 2024-05-09 06:54:23 |
合計ジャッジ時間 | 3,758 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 129 ms
89,560 KB |
testcase_01 | AC | 134 ms
89,652 KB |
testcase_02 | AC | 130 ms
89,200 KB |
testcase_03 | AC | 132 ms
89,608 KB |
testcase_04 | AC | 134 ms
89,420 KB |
testcase_05 | AC | 132 ms
89,644 KB |
testcase_06 | AC | 130 ms
89,608 KB |
testcase_07 | AC | 133 ms
89,648 KB |
testcase_08 | AC | 131 ms
89,540 KB |
testcase_09 | AC | 131 ms
89,168 KB |
testcase_10 | AC | 130 ms
89,768 KB |
testcase_11 | AC | 130 ms
89,720 KB |
testcase_12 | AC | 132 ms
89,220 KB |
testcase_13 | AC | 134 ms
89,436 KB |
testcase_14 | AC | 130 ms
89,564 KB |
testcase_15 | AC | 131 ms
89,464 KB |
testcase_16 | WA | - |
testcase_17 | AC | 130 ms
89,236 KB |
testcase_18 | AC | 132 ms
89,584 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 L == 0 and R == 0: print('Yes') exit() if R * K - L * K + 1 >= M or L * K <= M <= R * K: print('Yes') else: print('No') if __name__ == '__main__': main()