結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー McGregorshMcGregorsh
提出日時 2022-10-24 21:31:12
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,426 bytes
コンパイル時間 301 ms
コンパイル使用メモリ 86,816 KB
実行使用メモリ 92,556 KB
最終ジャッジ日時 2023-09-15 23:09:25
合計ジャッジ時間 21,275 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 243 ms
92,524 KB
testcase_01 AC 238 ms
92,316 KB
testcase_02 AC 236 ms
92,556 KB
testcase_03 AC 240 ms
92,320 KB
testcase_04 AC 243 ms
92,416 KB
testcase_05 AC 247 ms
92,112 KB
testcase_06 AC 244 ms
92,448 KB
testcase_07 AC 246 ms
92,420 KB
testcase_08 AC 248 ms
92,120 KB
testcase_09 AC 248 ms
92,412 KB
testcase_10 AC 246 ms
92,360 KB
testcase_11 AC 245 ms
92,432 KB
testcase_12 AC 248 ms
92,440 KB
testcase_13 AC 249 ms
92,416 KB
testcase_14 AC 248 ms
92,528 KB
testcase_15 AC 246 ms
92,520 KB
testcase_16 AC 243 ms
92,492 KB
testcase_17 AC 246 ms
92,420 KB
testcase_18 AC 247 ms
92,416 KB
testcase_19 AC 247 ms
92,120 KB
testcase_20 AC 244 ms
92,336 KB
testcase_21 AC 244 ms
92,312 KB
testcase_22 AC 240 ms
92,120 KB
testcase_23 AC 243 ms
92,316 KB
testcase_24 AC 245 ms
92,532 KB
testcase_25 AC 242 ms
92,120 KB
testcase_26 AC 245 ms
92,272 KB
testcase_27 AC 249 ms
92,428 KB
testcase_28 AC 245 ms
92,324 KB
testcase_29 AC 238 ms
92,372 KB
testcase_30 AC 246 ms
92,412 KB
testcase_31 AC 245 ms
92,376 KB
testcase_32 AC 244 ms
92,468 KB
testcase_33 AC 245 ms
92,316 KB
testcase_34 AC 244 ms
92,452 KB
testcase_35 AC 247 ms
92,400 KB
testcase_36 AC 240 ms
92,432 KB
testcase_37 AC 238 ms
92,380 KB
testcase_38 AC 236 ms
92,440 KB
testcase_39 AC 242 ms
92,132 KB
testcase_40 AC 246 ms
92,408 KB
testcase_41 AC 248 ms
92,312 KB
testcase_42 AC 245 ms
92,428 KB
testcase_43 AC 244 ms
92,356 KB
testcase_44 AC 245 ms
92,508 KB
testcase_45 AC 239 ms
92,404 KB
testcase_46 AC 239 ms
92,416 KB
testcase_47 AC 240 ms
92,440 KB
testcase_48 AC 243 ms
92,116 KB
testcase_49 AC 237 ms
92,440 KB
testcase_50 AC 238 ms
92,412 KB
testcase_51 AC 235 ms
92,352 KB
testcase_52 AC 240 ms
92,460 KB
testcase_53 AC 243 ms
92,336 KB
testcase_54 AC 244 ms
92,412 KB
testcase_55 AC 244 ms
92,412 KB
testcase_56 AC 248 ms
92,432 KB
testcase_57 AC 241 ms
92,384 KB
testcase_58 AC 243 ms
92,532 KB
testcase_59 AC 239 ms
92,304 KB
testcase_60 WA -
testcase_61 WA -
testcase_62 WA -
testcase_63 WA -
testcase_64 WA -
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
権限があれば一括ダウンロードができます

ソースコード

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
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():
   
   T = int(input())
   X, A = i_map()
   Y, B = i_map()
   
   if T > 0:
   	  p = T // A
   	  pcost1 = p * X
   	  amari1 = T % A
   	  score1 = pcost1 + amari1
   	  
   	  amari2 = A - amari1
   	  pcost2 = (p + 1) * X
   	  koeterukazu = (p + 1) * A - T
   	  if koeterukazu % B == 0:
   	  	  modoru = koeterukazu // B
   	  	  pcost3 = modoru * Y
   	  	  score2 = pcost2 + pcost3
   	  	  print(min(score1, score2))
   	  	  exit()
   	  else:
   	  	  modoru = koeterukazu // B + 1
   	  	  pcost3 = modoru * Y
   	  	  score2 = pcost2 + pcost3
   	  	  nokori = modoru * B - koeterukazu
   	  	  print(min(score1, score2 + nokori))
   	  	  exit()
   else:
   	  at = abs(T)
   	  if at % B == 0:
   	  	  print(at // B * Y)
   	  else:
   	  	  num = at // B + 1
   	  	  score1 = num * Y
   	  	  nokori = num * B - at
   	  	  if nokori % A == 0:
   	  	  	  score2 = nokori // A * X
   	  	  	  print(score1+score2)
   	  	  else:
   	  	  	  score2 = nokori // A * X
   	  	  	  ama = nokori % A
   	  	  	  print(score1+score2+ama)
   
if __name__ == '__main__':
    main()

0