Submission #1196501

#	Time	Username	Problem	Language	Result	Execution time	Memory
1196501		ofoz	Self Study (JOI22_ho_t2)	Pypy 3	62 / 100	1101 ms	131332 KiB

Main

from sys import stdout, setrecursionlimit
from math import ceil, floor, sqrt




def solve():
    n, m = map(int, input().split(" "))
    a = list(map(int, input().split(" ")))
    b = list(map(int, input().split(" ")))
    enum = list(range(n))
    enum = sorted(enum, key = lambda i: -max(a[i], b[i]))
    def is_possible(x: int):
        extra = 0
        for i in enum:
            if b[i] >= a[i]: p = b[i]
            else: p = a[i]

            op = ceil(x/p)
            if op <= m:
                extra += (m - op)
                continue
            
            needed = min(x - m * p, extra * b[i])
            op = ceil((x-needed) / p)
            if op > m: return False
            extra -= ceil(needed/b[i])

        return True

    l, r = 0, int(1e40)
    while r-l>1:
        mid = (l+r)//2
        if is_possible(mid): l = mid
        else: r = mid
    print(l)









solve()

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 38%)

=======

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