結果

問題 No.846 メダル
ユーザー McGregorshMcGregorsh
提出日時 2023-05-07 22:25:21
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,329 bytes
コンパイル時間 184 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 89,984 KB
最終ジャッジ日時 2024-05-03 17:46:14
合計ジャッジ時間 5,084 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 150 ms
89,600 KB
testcase_01 WA -
testcase_02 AC 152 ms
88,960 KB
testcase_03 AC 150 ms
89,344 KB
testcase_04 WA -
testcase_05 AC 149 ms
89,472 KB
testcase_06 AC 150 ms
89,600 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 151 ms
89,344 KB
testcase_13 AC 147 ms
89,216 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 148 ms
89,088 KB
testcase_19 AC 150 ms
89,088 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 146 ms
89,344 KB
testcase_23 AC 151 ms
89,472 KB
testcase_24 AC 156 ms
89,344 KB
testcase_25 AC 147 ms
89,088 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
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():
   
   P, Q, R = i_map()
   A, B, C = i_map()
   
   top = 10 ** 18
   under = 0
   
   while top - under > 1:
   	  mid = (top + under) // 2
   	  a = int(ceil(mid / P))
   	  b = int(ceil(mid / Q)) - a
   	  c = int(ceil(mid / R)) - (b + a)
   	  if a > A or b > B or c > C:
   	  	  top = mid
   	  else:
   	  	  under = mid
   
   top1 = 10 ** 18
   under1 = under
   while top1 - under1 > 1:
   	  mid = (top1 + under1) // 2
   	  a = int(ceil(mid / P))
   	  b = int(ceil(mid / Q)) - a
   	  c = int(ceil(mid / R)) - (b + a)
   	  if a > A or b > B or c > C:
   	  	  top1 = mid
   	  else:
   	  	  under1 = mid
   
   top2 = under
   under2 = -1
   while top2 - under2 > 1:
   	  mid = (top2 + under2) // 2
   	  a = int(ceil(mid / P))
   	  b = int(ceil(mid / Q)) - a
   	  c = int(ceil(mid / R)) - (b + a)
   	  if a < A or b < B or c < C:
   	  	  under2 = mid
   	  else:
   	  	  top2 = mid
   
   if under1 > top2:
   	  print(top2, under1)
   else:
   	  print(-1)
   
   
if __name__ == '__main__':
    main()
0