結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 647 ms
89,344 KB
testcase_01 AC 651 ms
89,600 KB
testcase_02 AC 474 ms
89,344 KB
testcase_03 AC 515 ms
89,600 KB
testcase_04 AC 185 ms
89,540 KB
testcase_05 AC 471 ms
89,600 KB
testcase_06 AC 483 ms
89,528 KB
testcase_07 AC 510 ms
89,600 KB
testcase_08 AC 643 ms
89,600 KB
testcase_09 AC 648 ms
89,428 KB
testcase_10 AC 654 ms
89,344 KB
testcase_11 AC 645 ms
89,472 KB
testcase_12 AC 658 ms
89,344 KB
testcase_13 AC 510 ms
89,728 KB
testcase_14 AC 192 ms
89,344 KB
testcase_15 AC 476 ms
89,624 KB
testcase_16 AC 477 ms
89,344 KB
testcase_17 AC 507 ms
89,648 KB
testcase_18 AC 603 ms
89,668 KB
testcase_19 AC 602 ms
89,472 KB
testcase_20 AC 605 ms
89,472 KB
testcase_21 AC 604 ms
89,364 KB
testcase_22 AC 646 ms
89,472 KB
testcase_23 AC 642 ms
89,216 KB
testcase_24 AC 593 ms
89,772 KB
testcase_25 AC 602 ms
89,728 KB
testcase_26 AC 602 ms
89,472 KB
testcase_27 AC 646 ms
89,728 KB
testcase_28 AC 508 ms
89,616 KB
testcase_29 AC 187 ms
89,600 KB
testcase_30 AC 477 ms
89,600 KB
testcase_31 AC 481 ms
89,472 KB
testcase_32 AC 504 ms
89,344 KB
testcase_33 AC 510 ms
89,564 KB
testcase_34 AC 185 ms
89,428 KB
testcase_35 AC 480 ms
89,428 KB
testcase_36 AC 471 ms
89,472 KB
testcase_37 AC 518 ms
89,472 KB
testcase_38 AC 611 ms
89,600 KB
testcase_39 AC 616 ms
89,512 KB
testcase_40 AC 615 ms
89,600 KB
testcase_41 AC 645 ms
89,364 KB
testcase_42 AC 615 ms
89,344 KB
testcase_43 AC 647 ms
89,344 KB
testcase_44 AC 606 ms
89,724 KB
testcase_45 AC 596 ms
89,728 KB
testcase_46 AC 642 ms
89,216 KB
testcase_47 AC 635 ms
89,472 KB
testcase_48 AC 514 ms
89,984 KB
testcase_49 AC 189 ms
89,216 KB
testcase_50 AC 477 ms
89,472 KB
testcase_51 AC 487 ms
89,344 KB
testcase_52 AC 518 ms
89,728 KB
testcase_53 AC 188 ms
89,344 KB
testcase_54 AC 397 ms
89,600 KB
testcase_55 AC 599 ms
89,344 KB
testcase_56 AC 650 ms
89,344 KB
testcase_57 AC 477 ms
89,344 KB
testcase_58 AC 490 ms
89,352 KB
testcase_59 AC 649 ms
89,600 KB
testcase_60 AC 478 ms
89,556 KB
testcase_61 AC 650 ms
89,216 KB
testcase_62 AC 485 ms
89,856 KB
testcase_63 AC 666 ms
89,612 KB
testcase_64 AC 476 ms
89,600 KB
testcase_65 AC 763 ms
89,720 KB
testcase_66 AC 485 ms
89,520 KB
testcase_67 AC 795 ms
89,728 KB
testcase_68 AC 478 ms
89,600 KB
testcase_69 AC 647 ms
89,472 KB
testcase_70 AC 480 ms
89,600 KB
testcase_71 AC 810 ms
89,884 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