結果
問題 | No.2259 Gas Station |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 21:20:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 266 ms / 2,000 ms |
コード長 | 1,579 bytes |
コンパイル時間 | 942 ms |
コンパイル使用メモリ | 87,244 KB |
実行使用メモリ | 92,492 KB |
最終ジャッジ日時 | 2023-08-18 12:27:16 |
合計ジャッジ時間 | 9,147 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 265 ms
92,252 KB |
testcase_01 | AC | 262 ms
92,108 KB |
testcase_02 | AC | 261 ms
92,172 KB |
testcase_03 | AC | 257 ms
92,400 KB |
testcase_04 | AC | 264 ms
92,232 KB |
testcase_05 | AC | 260 ms
92,308 KB |
testcase_06 | AC | 266 ms
92,492 KB |
testcase_07 | AC | 261 ms
92,372 KB |
testcase_08 | AC | 263 ms
92,260 KB |
testcase_09 | AC | 263 ms
92,060 KB |
testcase_10 | AC | 265 ms
92,296 KB |
testcase_11 | AC | 264 ms
92,276 KB |
testcase_12 | AC | 264 ms
92,404 KB |
testcase_13 | AC | 260 ms
92,128 KB |
testcase_14 | AC | 260 ms
92,080 KB |
testcase_15 | AC | 263 ms
92,360 KB |
testcase_16 | AC | 263 ms
92,212 KB |
testcase_17 | AC | 261 ms
92,404 KB |
testcase_18 | AC | 262 ms
92,492 KB |
testcase_19 | AC | 258 ms
92,128 KB |
testcase_20 | AC | 258 ms
92,480 KB |
testcase_21 | AC | 261 ms
92,220 KB |
testcase_22 | AC | 263 ms
92,356 KB |
testcase_23 | AC | 260 ms
92,292 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)) % 1000 ans = min(ans, score) print(ans) if __name__ == '__main__': main()