Submission #651848

#	Time	Username	Problem	Language	Result	Execution time	Memory
651848		beaconmc	Self Study (JOI22_ho_t2)	Pypy 2	0 / 100	26 ms	19372 KiB

Main

from math import *
import sys
input = lambda: sys.stdin.readline().strip()
n,m = map(int, input().split())

lis = list(map(int, input().split()))
lis2 = list(map(int, input().split()))

def check(a):
    cnt = 0
    for i in range(n):
        if lis[i]>lis2[i]:
            if a > lis[i]*m:
                cnt += ceil((a-(lis[i]*m))/lis2[i]) + m
            else:
                cnt += ceil(a/lis[i])
        else:
            cnt += ceil(a/lis2[i])
    if cnt <= n*m:
        return True
    return False
lo = 0
hi = 100000000000000000
while lo<hi:
    mid = (lo+hi+1)//2
    if check(mid):
        lo = mid
    else:
        hi = mid-1
print(lo)

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9