Submission #8404031

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

#define REP(i,n)    for(int i = 0; i < (int)n; i++)
#define N_MAX   50000
#define M_MAX   50000
#define x_MAX   100
#define y_MAX   100
#define z_MAX   100

int N,M;
int dp[105][105][105];

void solve() {
	int i,j,k,l,r,x,y,z; string s;
	
	cin>>N>>M;
	while(N--) cin>>x>>y>>z>>r, dp[x][y][z]=max(dp[x][y][z],r);
	REP(x,101) REP(y,101) REP(z,101) {
		dp[x+1][y][z]=max(dp[x+1][y][z],dp[x][y][z]);
		dp[x][y+1][z]=max(dp[x][y+1][z],dp[x][y][z]);
		dp[x][y][z+1]=max(dp[x][y][z+1],dp[x][y][z]);
	}
	while(M--) cin>>x>>y>>z, cout<<dp[x][y][z]<<endl;
}

int main (){
    solve();
    
    return 0;
}

Submission Info

Judge Result