結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー McGregorshMcGregorsh
提出日時 2022-10-24 21:31:12
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,426 bytes
コンパイル時間 339 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 89,728 KB
最終ジャッジ日時 2024-07-03 00:27:09
合計ジャッジ時間 15,529 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 60 WA * 12
権限があれば一括ダウンロードができます

ソースコード

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