Submission #7090323

---

Source Code Expand

from collections import defaultdict
from heapq import heappush, heappop
import math
import bisect
import random
def LI(): return list(map(int, input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
mod = 1000000007

w, h = LI()
n = I()
xy_list = [(x - 1, y - 1) for x, y in  LIR(n)]


memo = defaultdict(lambda: -1)




def recur(l, r, d, u):
    if memo[(l, r, d, u)] != -1:
        return memo[(l, r, d, u)]
    ret = 0
    for x, y in xy_list:
        if l <= x < r and d <= y < u:
            ret = max(recur(l, x, d, y) + recur(l, x, y + 1, u) + recur(x + 1, r, d, y) + recur(x + 1, r, y + 1, u) + \
                u - d + r - l - 1, ret)
    memo[(l, r, u, d)] = ret
    return ret


print(recur(0, w, 0, h))

Submission Info

Judge Result