Submission #2521342

---

Source Code Expand

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

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}


template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  Int n,m;
  cin>>n>>m;
  const Int MAX = 111;
  auto dp=make_v<Int>(MAX,MAX,MAX);
  fill_v(dp,0);
  for(Int i=0;i<n;i++){
    Int a,b,c,d;
    cin>>a>>b>>c>>d;
    chmax(dp[a][b][c],d);
  }
  for(Int i=0;i+1<MAX;i++){
    for(Int j=0;j+1<MAX;j++){
      for(Int k=0;k+1<MAX;k++){
	chmax(dp[i+1][j][k],dp[i][j][k]);
	chmax(dp[i][j+1][k],dp[i][j][k]);
	chmax(dp[i][j][k+1],dp[i][j][k]);
      }
    }
  }
  
  for(Int i=0;i<m;i++){
    Int x,y,z;
    cin>>x>>y>>z;
    cout<<dp[x][y][z]<<endl;
  }
  return 0;
}

Submission Info

Judge Result