Submission #2975829

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n, m;
int dp[101][101][101] = {0};

int main() {
  int i, j, k, x, y, z, p;
  cin >> n >> m;
  for(i = 0; i < n; ++i) {
    cin >> x >> y >> z >> p;
    dp[x][y][z] = max(p, dp[x][y][z]);
  }
  for(i = 0; i <= 100; ++i)
    for(j = 0; j <= 100; ++j)
      for(k = 0; k <= 100; ++k) {
        int ri = max(i - 1, 0), rj = max(j - 1, 0),
            rk = max(k - 1, 0);
        for(x = ri; x <= i; ++x)
          for(y = rj; y <= j; ++y)
            for(z = rk; z <= k; ++z)
              dp[i][j][k] = max(dp[i][j][k], dp[x][y][z]);
      }
  for(i = 0; i < m; ++i) {
    cin >> x >> y >> z;
    cout << dp[x][y][z] << endl;
  }
  return 0;
}

Submission Info

Judge Result