結果

問題 No.2099 [Cherry Alpha B] Time Machine
ユーザー PandaPanda
提出日時 2022-10-24 21:31:12
言語 PyPy3
(7.3.8)
結果
WA  
実行時間 -
コード長 2,426 bytes
コンパイル時間 246 ms
使用メモリ 99,580 KB
最終ジャッジ日時 2023-02-04 02:25:26
合計ジャッジ時間 21,464 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 242 ms
99,296 KB
testcase_01 AC 243 ms
99,276 KB
testcase_02 AC 244 ms
99,576 KB
testcase_03 AC 242 ms
99,244 KB
testcase_04 AC 240 ms
99,320 KB
testcase_05 AC 241 ms
99,068 KB
testcase_06 AC 239 ms
99,312 KB
testcase_07 AC 240 ms
99,300 KB
testcase_08 AC 243 ms
99,572 KB
testcase_09 AC 239 ms
99,240 KB
testcase_10 AC 242 ms
99,264 KB
testcase_11 AC 239 ms
99,204 KB
testcase_12 AC 241 ms
99,224 KB
testcase_13 AC 240 ms
99,508 KB
testcase_14 AC 241 ms
99,340 KB
testcase_15 AC 240 ms
99,192 KB
testcase_16 AC 241 ms
99,308 KB
testcase_17 AC 241 ms
99,292 KB
testcase_18 AC 240 ms
99,176 KB
testcase_19 AC 244 ms
99,224 KB
testcase_20 AC 237 ms
99,364 KB
testcase_21 AC 237 ms
99,156 KB
testcase_22 AC 238 ms
99,192 KB
testcase_23 AC 236 ms
99,316 KB
testcase_24 AC 241 ms
99,392 KB
testcase_25 AC 241 ms
99,300 KB
testcase_26 AC 242 ms
99,288 KB
testcase_27 AC 239 ms
99,380 KB
testcase_28 AC 239 ms
99,300 KB
testcase_29 AC 238 ms
99,156 KB
testcase_30 AC 239 ms
99,284 KB
testcase_31 AC 237 ms
99,220 KB
testcase_32 AC 242 ms
99,176 KB
testcase_33 AC 240 ms
99,168 KB
testcase_34 AC 244 ms
99,432 KB
testcase_35 AC 240 ms
99,540 KB
testcase_36 AC 240 ms
99,316 KB
testcase_37 AC 239 ms
99,168 KB
testcase_38 AC 239 ms
99,364 KB
testcase_39 AC 240 ms
99,320 KB
testcase_40 AC 241 ms
99,172 KB
testcase_41 AC 239 ms
99,328 KB
testcase_42 AC 239 ms
99,232 KB
testcase_43 AC 241 ms
99,292 KB
testcase_44 AC 237 ms
99,232 KB
testcase_45 AC 239 ms
99,108 KB
testcase_46 AC 242 ms
99,296 KB
testcase_47 AC 238 ms
99,312 KB
testcase_48 AC 239 ms
99,296 KB
testcase_49 AC 240 ms
99,272 KB
testcase_50 AC 239 ms
99,092 KB
testcase_51 AC 238 ms
99,228 KB
testcase_52 AC 239 ms
99,232 KB
testcase_53 AC 240 ms
99,104 KB
testcase_54 AC 237 ms
99,312 KB
testcase_55 AC 233 ms
99,564 KB
testcase_56 AC 238 ms
99,328 KB
testcase_57 AC 240 ms
99,184 KB
testcase_58 AC 241 ms
99,232 KB
testcase_59 AC 241 ms
99,224 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