Submission #1607097

---

Source Code Expand

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


def ok(a, i, j, l, o):
    if a > min(i, j, l):
        return 0
    i -= a
    j -= a
    l -= a
    return 6 * a + (i // 2) * 4 + (j // 2) * 4 + (l // 2) * 4 + o * 2


def main():
    i, o, t, j, l, s, z = map(int, input().split())

    low, high, ans = -1, int(1e14) - 1, 0
    while high - low > 1:
        middle = (low + high) // 2
        if ok(middle, i, j, l, o) > ans:
            ans = ok(middle, i, j, l, o)
            low = middle
        else:
            high = middle

    print(ans // 2)


if __name__ == '__main__':
    main()

Submission Info

Judge Result