Submission #5117959

---

Source Code Expand

from functools import lru_cache
import sys
sys.setrecursionlimit(1000000)

A, B = map(int, input().split())
X = [int(a) for a in input().split()]
Y = [int(a) for a in input().split()]

@lru_cache(maxsize=None)
def calc(a, b):
    if a == A and b == B:
        return 0
    if (a+b) % 2 == 0:
        ret = 0
        if a < A:
            ret = max(ret, X[a] + calc(a + 1, b))
        if b < B:
            ret = max(ret, Y[b] + calc(a, b + 1))
        return ret
    else:
        ret = 10 ** 100
        if a < A:
            ret = min(ret, calc(a + 1, b))
        if b < B:
            ret = min(ret, calc(a, b + 1))
        return ret

print(calc(0, 0))

Submission Info

Judge Result