CCF Python题解(超时)201809-4 再卖菜

注意：

模拟试题中python给的时间限制只有1s，但考场会给10s,该题解在模拟试题提交会出现运行超时，寻求更快速的代码请考虑差分约束。

num = int(input())
new = list(map(int, input().split()))
old = [0 for i in range(num)]
visited = [[[0 for k in range(300)] for i in range(300)] for j in range(300)]


def dfs(n, x, y):
    if visited[n][x][y]:
        return
    visited[n][x][y] = 1
    if n == num - 2:
        flag = False
        for j in range(3):
            if (3 * new[n] + j - x) // 2 == new[-1]:
                flag = True
                old[-1] = 3 * new[n] + j - x - y
                break
        if flag:
            for i in old:
                print(i, end=" ")
            exit()
    for i in range(3):
        old[n + 1] = 3 * new[n] + i - x - y
        if old[n + 1] > 0:
            dfs(n + 1, y, old[n + 1])


for i in range(1, 2 * new[0] + 1):
    old[0] = i
    old[1] = 2 * new[0] - i
    dfs(1, i, old[1])
    old[1] = 2 * new[0] + 1 - i
    dfs(1, i, old[1])