結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー McGregorshMcGregorsh
提出日時 2023-05-23 23:34:16
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 750 ms / 2,000 ms
コード長 2,284 bytes
コンパイル時間 187 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 89,960 KB
最終ジャッジ日時 2024-06-02 11:18:49
合計ジャッジ時間 34,489 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 528 ms
89,728 KB
testcase_01 AC 528 ms
89,532 KB
testcase_02 AC 383 ms
89,552 KB
testcase_03 AC 401 ms
89,640 KB
testcase_04 AC 145 ms
89,600 KB
testcase_05 AC 383 ms
89,856 KB
testcase_06 AC 388 ms
89,548 KB
testcase_07 AC 398 ms
89,560 KB
testcase_08 AC 524 ms
89,600 KB
testcase_09 AC 529 ms
89,728 KB
testcase_10 AC 536 ms
89,728 KB
testcase_11 AC 529 ms
89,600 KB
testcase_12 AC 538 ms
89,344 KB
testcase_13 AC 400 ms
89,728 KB
testcase_14 AC 145 ms
89,472 KB
testcase_15 AC 391 ms
89,728 KB
testcase_16 AC 384 ms
89,960 KB
testcase_17 AC 395 ms
89,856 KB
testcase_18 AC 467 ms
89,664 KB
testcase_19 AC 468 ms
89,752 KB
testcase_20 AC 472 ms
89,472 KB
testcase_21 AC 488 ms
89,472 KB
testcase_22 AC 529 ms
89,600 KB
testcase_23 AC 527 ms
89,600 KB
testcase_24 AC 461 ms
89,728 KB
testcase_25 AC 479 ms
89,772 KB
testcase_26 AC 476 ms
89,856 KB
testcase_27 AC 549 ms
89,488 KB
testcase_28 AC 402 ms
89,596 KB
testcase_29 AC 146 ms
89,472 KB
testcase_30 AC 404 ms
89,676 KB
testcase_31 AC 420 ms
89,600 KB
testcase_32 AC 426 ms
89,600 KB
testcase_33 AC 407 ms
89,856 KB
testcase_34 AC 146 ms
89,472 KB
testcase_35 AC 386 ms
89,724 KB
testcase_36 AC 393 ms
89,744 KB
testcase_37 AC 399 ms
89,596 KB
testcase_38 AC 476 ms
89,728 KB
testcase_39 AC 471 ms
89,728 KB
testcase_40 AC 485 ms
89,600 KB
testcase_41 AC 528 ms
89,780 KB
testcase_42 AC 481 ms
89,728 KB
testcase_43 AC 538 ms
89,728 KB
testcase_44 AC 498 ms
89,216 KB
testcase_45 AC 473 ms
89,624 KB
testcase_46 AC 539 ms
89,472 KB
testcase_47 AC 480 ms
89,600 KB
testcase_48 AC 414 ms
89,472 KB
testcase_49 AC 146 ms
89,600 KB
testcase_50 AC 393 ms
89,728 KB
testcase_51 AC 400 ms
89,600 KB
testcase_52 AC 402 ms
89,728 KB
testcase_53 AC 145 ms
89,344 KB
testcase_54 AC 320 ms
89,600 KB
testcase_55 AC 474 ms
89,708 KB
testcase_56 AC 541 ms
89,728 KB
testcase_57 AC 402 ms
89,600 KB
testcase_58 AC 395 ms
89,436 KB
testcase_59 AC 533 ms
89,344 KB
testcase_60 AC 402 ms
89,728 KB
testcase_61 AC 559 ms
89,216 KB
testcase_62 AC 399 ms
89,496 KB
testcase_63 AC 535 ms
89,728 KB
testcase_64 AC 396 ms
89,600 KB
testcase_65 AC 627 ms
89,600 KB
testcase_66 AC 390 ms
89,600 KB
testcase_67 AC 634 ms
89,836 KB
testcase_68 AC 392 ms
89,500 KB
testcase_69 AC 541 ms
89,728 KB
testcase_70 AC 395 ms
89,600 KB
testcase_71 AC 750 ms
89,344 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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, lru_cache
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
alpa = 'abcdefghijklmnopqrstuvwxyz'
ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
#input = sys.stdin.readline


def main():
   
   T = int(input())
   X, A = i_map()
   Y, B = i_map()
   
   if T == 0:
   	  print(0)
   	  exit()
   
   if T > 0:
   	  ans = INF
   	  for i in range(10**7+1):
   	  	  p = A * i
   	  	  score = X * i
   	  	  if T >= p:
   	  	  	  cost = score + (T - p)
   	  	  	  ans = min(ans, cost)
   	  	  else:
   	  	  	  amari = p - T
   	  	  	  pp = (B - (amari % B)) % B
   	  	  	  cost = pp + ((pp + amari) // B) * Y + score
   	  	  	  ans = min(ans, cost)
   	  print(ans)
   else:
   	  ans = INF
   	  for i in range(10**7+1):
   	  	  p = -B * i
   	  	  score = Y * i
   	  	  if T >= p:
   	  	  	  amari = abs(p - T)
   	  	  	  aamari = amari % A
   	  	  	  amari -= aamari
   	  	  	  cost = amari // A * X
   	  	  	  total = score + aamari + cost
   	  	  	  ans = min(ans, total)
   	  print(ans)
   	  
   
if __name__ == '__main__':
    main()
0