結果
問題 | No.804 野菜が苦手 |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:15:51 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 143 ms / 2,000 ms |
コード長 | 1,599 bytes |
コンパイル時間 | 704 ms |
コンパイル使用メモリ | 82,444 KB |
実行使用メモリ | 89,864 KB |
最終ジャッジ日時 | 2024-04-18 10:43:35 |
合計ジャッジ時間 | 4,220 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 130 ms
89,636 KB |
testcase_01 | AC | 126 ms
89,200 KB |
testcase_02 | AC | 132 ms
89,384 KB |
testcase_03 | AC | 125 ms
89,516 KB |
testcase_04 | AC | 126 ms
89,448 KB |
testcase_05 | AC | 128 ms
89,644 KB |
testcase_06 | AC | 139 ms
89,568 KB |
testcase_07 | AC | 143 ms
89,716 KB |
testcase_08 | AC | 136 ms
89,588 KB |
testcase_09 | AC | 137 ms
89,864 KB |
testcase_10 | AC | 139 ms
89,660 KB |
testcase_11 | AC | 138 ms
89,624 KB |
testcase_12 | AC | 141 ms
89,560 KB |
testcase_13 | AC | 138 ms
89,700 KB |
testcase_14 | AC | 135 ms
89,544 KB |
testcase_15 | AC | 128 ms
89,232 KB |
testcase_16 | AC | 132 ms
89,704 KB |
testcase_17 | AC | 130 ms
89,196 KB |
testcase_18 | AC | 124 ms
89,308 KB |
testcase_19 | AC | 132 ms
89,040 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(): A, B, C, D = i_map() top = 10 ** 18 under = 0 while top - under > 1: mid = (top + under) // 2 if mid + mid * C <= D and mid <= A and mid * C <= B: under = mid else: top = mid print(under) if __name__ == '__main__': main()