Submission #2203425

---

Source Code Expand

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)

def bs(f, mi, ma):
    mm = (ma+mi) // 2

    if ma <= mi:
        if f(mm):
            return mm + 1
        return mm

    if f(mm):
        mi = mm + 1
    else:
        ma = mm

    return bs(f, mi, ma)

def main():
    n = I()
    a = [LI() for _ in range(n)]

    def f(t):
        b = sorted([(t-c) // d for c,d in a])
        for i in range(n):
            if b[i] < i:
                return True
        return False

    return bs(f, 0, 10**14)


print(main())

Submission Info

Judge Result