結果
問題 | No.2259 Gas Station |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 12:21:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,570 bytes |
コンパイル時間 | 343 ms |
コンパイル使用メモリ | 86,764 KB |
実行使用メモリ | 92,644 KB |
最終ジャッジ日時 | 2023-08-18 07:38:12 |
合計ジャッジ時間 | 8,875 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,312 KB |
testcase_01 | WA | - |
testcase_02 | AC | 227 ms
92,348 KB |
testcase_03 | AC | 229 ms
92,412 KB |
testcase_04 | WA | - |
testcase_05 | AC | 222 ms
92,572 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 231 ms
92,612 KB |
testcase_09 | AC | 231 ms
92,256 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 226 ms
92,488 KB |
testcase_14 | AC | 230 ms
92,568 KB |
testcase_15 | AC | 226 ms
92,388 KB |
testcase_16 | AC | 230 ms
92,264 KB |
testcase_17 | AC | 229 ms
92,436 KB |
testcase_18 | AC | 228 ms
92,348 KB |
testcase_19 | AC | 228 ms
92,256 KB |
testcase_20 | AC | 229 ms
92,564 KB |
testcase_21 | AC | 226 ms
92,584 KB |
testcase_22 | AC | 228 ms
92,460 KB |
testcase_23 | AC | 228 ms
92,644 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, C = i_map() if R - L >= 1000: print(0) 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()