Submission #2485587

---

Source Code Expand

N, M = map(int, input().split())
L = 100
dp = [[[0]*(L+1) for i in range(L+1)] for j in range(L+1)]
for i in range(N):
    a, b, c, w = map(int, input().split())
    dp[a][b][c] = max(dp[a][b][c], w)
for i in range(0, L+1):
    for j in range(0, L+1):
        for k in range(0, L+1):
            res = 0
            if i > 0:
                res = max(res, dp[i-1][j][k])
            if j > 0:
                res = max(res, dp[i][j-1][k])
            if k > 0:
                res = max(res, dp[i][j][k-1])
            dp[i][j][k] = max(dp[i][j][k], res)
ans = []
for i in range(M):
    x, y, z = map(int, input().split())
    ans.append(dp[x][y][z])
print(*ans, sep='\n')

Submission Info

Judge Result