Submission #2176162

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <tuple>

using namespace std;

int main(){
	int N,M;
	cin >> N >> M;
	int dp[102][102][102] = {};
	for(int i=0;i<N;i++){
		int a,b,c,w;
		cin >> a >> b >> c >> w;
		dp[a][b][c] = max(w, dp[a][b][c]);
	}

	for(int i=0;i<101;i++){
		for(int j=0;j<101;j++){
			for(int k=0;k<101;k++){
				dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);
				dp[i][j+1][k] = max(dp[i][j+1][k], dp[i][j][k]);
				dp[i][j][k+1] = max(dp[i][j][k+1], dp[i][j][k]);
			}
		}
	}

	for(int i=0;i<M;i++){
		int a,b,c;
		cin >> a >> b >> c;
		cout << dp[a][b][c] << endl;
	}
	
	return 0;
}

Submission Info

Judge Result