Submission #19058094

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template <class T> using V = vector<T>;
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }
template<class T> bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }
struct in { template <class T> operator T() { T t; std::cin >> t; return t; } };
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
int dx[8] = {0,1,0,-1,1,1,-1,-1};
int dy[8] = {1,0,-1,0,1,-1,1,-1};

auto solve() {
   int n = in();
   int m = in();
   // vector<int> a(n),b(n),c(n),w(n),x(m),y(m),z(m);
   // rep(i,n) cin >> a[i] >> b[i] >> c[i] >> w[i];
   // rep(i,m) cin >> x[i] >> y[i] >> z[i];

   int lim = 100;
   V<V<V<int>>> s(lim+1, V<V<int>>(lim+1, V<int>(lim+1, 0)));
   rep(i,n) {
      int a = in(), b = in(), c = in(), w = in();
      chmax(s[a][b][c], w);
   }

   rep(i,lim+1) rep(j,lim+1) rep(k,lim+1) {
      if (i > 0) chmax(s[i][j][k], s[i-1][j][k]);
      if (j > 0) chmax(s[i][j][k], s[i][j-1][k]);
      if (k > 0) chmax(s[i][j][k], s[i][j][k-1]);
   }
   rep(i,m) {
      int x = in(), y = in(), z = in();
      cout << s[x][y][z] << endl;
   }
}

int main() {
   ios::sync_with_stdio(false);
   cin.tie(0);

   solve();
}

Submission Info

Judge Result