Submission #16520635

---

Source Code Expand

N, M = map(int,input().split())

dp = [[[0 for i in range(101)] for j in range(101)] for k in range(101)]

for _ in range(N):
    a, b, c, w = map(int,input().split())
    dp[a][b][c] = max(w, dp[a][b][c])

for a in range(101):
    for b in range(101):
        for c in range(101):
            if a > 0:
                dp[a][b][c] = max(dp[a][b][c], dp[a-1][b][c])
            if b > 0:
                dp[a][b][c] = max(dp[a][b][c], dp[a][b-1][c])
            if c > 0:
                dp[a][b][c] = max(dp[a][b][c], dp[a][b][c-1])

for _ in range(M):
    x, y, z = map(int,input().split())
    print(dp[x][y][z])

Submission Info

Judge Result