結果
問題 | No.2259 Gas Station |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 12:24:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,707 bytes |
コンパイル時間 | 784 ms |
コンパイル使用メモリ | 87,272 KB |
実行使用メモリ | 92,556 KB |
最終ジャッジ日時 | 2023-08-18 07:40:11 |
合計ジャッジ時間 | 7,980 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 261 ms
92,368 KB |
testcase_01 | WA | - |
testcase_02 | AC | 256 ms
92,292 KB |
testcase_03 | AC | 255 ms
92,468 KB |
testcase_04 | WA | - |
testcase_05 | AC | 265 ms
92,500 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 260 ms
92,496 KB |
testcase_09 | AC | 258 ms
92,352 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 260 ms
92,364 KB |
testcase_17 | AC | 264 ms
92,392 KB |
testcase_18 | AC | 260 ms
92,204 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | 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(): L, R, C = i_map() if R - L >= 1000: ans = INF for i in range(1000): p = (L + i) * C score = 1000 - (p % 1000) ans = min(ans, score) print(ans) else: ans = INF for i in range(L, R+1): p = C * i score = 1000 - (p % 1000) ans = min(ans, score) print(ans) if __name__ == '__main__': main()