Submission #3768647

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, m; cin >> n >> m;
  vector<vector<vector<int>>> dp(110, vector<vector<int>>(110, vector<int>(110, 0)));
  REP(i, n) {
    int a, b, c, w; cin >> a >> b >> c >> w;
    dp[a][b][c] = max(dp[a][b][c], w);
  }
  REP(i, 101) REP(j, 101) REP(k, 101) {
    dp[i][j][k+1] = max(dp[i][j][k+1], dp[i][j][k]);
    dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);
    dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);
  }
  REP(i, m) {
    int x, y, z; cin >> x >> y >> z;
    cout << dp[x][y][z] << '\n';
  }
  return 0;
}

Submission Info

Judge Result