Roller coaster

from fractions import Fraction

def num_works(num, req):
    happy = 0
    num = Fraction(num)
    for r in req:
        a, b, c, d = map(Fraction, r)
        if b > num:
            return False
        if a <= num:
            happy += 1
        val = num * d / 100
        num = num - val - c
    return Fraction(happy, len(req)) >= Fraction(1, 2)


def binary_search(req):
    low = 0
    high = 2010101010101010100000000  

    while low <= high:
        mid = (low + high) // 2
        if not num_works(mid, req):
            low = mid + 1
        else:
            if not num_works(mid - 1, req):
                return mid
            else:
                high = mid - 1
    return -1


def main():
    n = int(input())
    req = [list(map(int, input().split())) for _ in range(n)]
    res = binary_search(req)
    print(res)


if __name__ == "__main__":
    main()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED