Submission #19081024

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using vvin=vector<vin>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vst=vector<string>;
using P = pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const int inf=1e9+7;
const ll INF=9e18/2;
const long double PI = acos(-1.0); 
template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}
template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };

ll dp[110][110][110];

int main(){//cout<<fixed<<setprecision(20);
  int n,m;
  cin>>n>>m;
  rep(i,0,n){
    ll a,b,c,w;
    cin>>a>>b>>c>>w;
    chmax(dp[a][b][c],w);
  }
  
  rep(i,1,110){
   rep(j,1,110){
    rep(k,1,110){
      if(i-1>=0)chmax(dp[i][j][k],dp[i-1][j][k]);
      if(j-1>=0)chmax(dp[i][j][k],dp[i][j-1][k]);
      if(k-1>=0)chmax(dp[i][j][k],dp[i][j][k-1]);
    }
   }
  }
  
  
  rep(i,0,m){
    ll x,y,z;
    cin>>x>>y>>z;
    cout<<dp[x][y][z]<<endl;
  }
}

Submission Info

Judge Result