結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー McGregorshMcGregorsh
提出日時 2023-05-23 23:34:16
言語 PyPy3
(7.3.11)
結果
AC  
実行時間 868 ms / 2,000 ms
コード長 2,284 bytes
コンパイル時間 429 ms
コンパイル使用メモリ 87,156 KB
実行使用メモリ 93,392 KB
最終ジャッジ日時 2023-08-24 22:06:15
合計ジャッジ時間 48,767 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 713 ms
92,976 KB
testcase_01 AC 709 ms
92,784 KB
testcase_02 AC 544 ms
93,080 KB
testcase_03 AC 583 ms
92,996 KB
testcase_04 AC 261 ms
92,540 KB
testcase_05 AC 547 ms
93,076 KB
testcase_06 AC 542 ms
92,708 KB
testcase_07 AC 577 ms
93,080 KB
testcase_08 AC 711 ms
92,764 KB
testcase_09 AC 711 ms
92,848 KB
testcase_10 AC 716 ms
92,980 KB
testcase_11 AC 712 ms
92,784 KB
testcase_12 AC 715 ms
92,936 KB
testcase_13 AC 574 ms
93,048 KB
testcase_14 AC 259 ms
92,940 KB
testcase_15 AC 550 ms
92,996 KB
testcase_16 AC 543 ms
92,796 KB
testcase_17 AC 580 ms
92,928 KB
testcase_18 AC 658 ms
93,132 KB
testcase_19 AC 648 ms
93,144 KB
testcase_20 AC 663 ms
93,024 KB
testcase_21 AC 668 ms
93,220 KB
testcase_22 AC 719 ms
92,940 KB
testcase_23 AC 719 ms
92,708 KB
testcase_24 AC 647 ms
93,216 KB
testcase_25 AC 663 ms
93,344 KB
testcase_26 AC 666 ms
92,940 KB
testcase_27 AC 721 ms
92,860 KB
testcase_28 AC 581 ms
93,168 KB
testcase_29 AC 261 ms
92,948 KB
testcase_30 AC 549 ms
92,952 KB
testcase_31 AC 545 ms
92,944 KB
testcase_32 AC 585 ms
93,128 KB
testcase_33 AC 587 ms
93,144 KB
testcase_34 AC 263 ms
92,924 KB
testcase_35 AC 555 ms
92,980 KB
testcase_36 AC 549 ms
92,856 KB
testcase_37 AC 578 ms
93,016 KB
testcase_38 AC 653 ms
93,132 KB
testcase_39 AC 658 ms
92,992 KB
testcase_40 AC 655 ms
93,144 KB
testcase_41 AC 715 ms
93,032 KB
testcase_42 AC 671 ms
93,212 KB
testcase_43 AC 733 ms
92,892 KB
testcase_44 AC 672 ms
93,392 KB
testcase_45 AC 669 ms
93,304 KB
testcase_46 AC 716 ms
92,980 KB
testcase_47 AC 676 ms
93,064 KB
testcase_48 AC 592 ms
93,080 KB
testcase_49 AC 269 ms
92,704 KB
testcase_50 AC 547 ms
92,836 KB
testcase_51 AC 552 ms
92,984 KB
testcase_52 AC 588 ms
92,924 KB
testcase_53 AC 269 ms
92,664 KB
testcase_54 AC 472 ms
93,352 KB
testcase_55 AC 656 ms
93,176 KB
testcase_56 AC 727 ms
92,852 KB
testcase_57 AC 550 ms
92,860 KB
testcase_58 AC 552 ms
92,984 KB
testcase_59 AC 719 ms
92,856 KB
testcase_60 AC 552 ms
92,884 KB
testcase_61 AC 717 ms
92,868 KB
testcase_62 AC 561 ms
92,884 KB
testcase_63 AC 724 ms
92,872 KB
testcase_64 AC 557 ms
92,908 KB
testcase_65 AC 816 ms
93,260 KB
testcase_66 AC 556 ms
92,932 KB
testcase_67 AC 843 ms
92,940 KB
testcase_68 AC 550 ms
92,708 KB
testcase_69 AC 713 ms
92,912 KB
testcase_70 AC 552 ms
92,908 KB
testcase_71 AC 868 ms
93,080 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