Submission #2980006

---

Source Code Expand

#include <iostream>
using namespace std;
typedef long long ll;
ll n, m, dp[101][101][101], a, b, c, w, x, y, z;
int main(void){
    // Your code here!
    cin >> n >> m;
    for (ll i = 0; i < n; i++) {
        cin >> a >> b >> c >> w;
        dp[a][b][c] = max(dp[a][b][c], w);
    }
    for (ll i = 0; i <= 100; i++) {
        for (ll j = 0; j <= 100; j++) {
            for (ll k = 0; k <= 100; k++) {
                if (i) dp[i][j][k] = max(dp[i - 1][j][k], dp[i][j][k]);
                if (j) dp[i][j][k] = max(dp[i][j - 1][k], dp[i][j][k]);
                if (k) dp[i][j][k] = max(dp[i][j][k - 1], dp[i][j][k]);
            }
        }
    }
    for (ll i = 0; i < m; i++) {
        cin >> x >> y >> z;
        cout << dp[x][y][z] << endl;
    }
}

Submission Info

Judge Result