矩形嵌套

def solve(____):
    rects = [tuple(map(int, r.split(____))) for r in rectangles.split(____)]
    n = len(____)
    graph = [[] for _ in range(____)]
    for i in range(____):
        for j in range(____):
            if i != j:
                if (____) or                    (____):
                    graph[i].append(____)
    dp = [-____] * n
    def dfs(____):
        if dp[u] != -____:
            return dp[u]
        dp[u] = ____
        for v in graph[u]:
            dp[u] = max(dp[u], dfs(____) + ____)
        return dp[u]
    print(max(dfs(____) for i in range(____)))