Submission #2998187

---

Source Code Expand

#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <iomanip>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
const int inf = 1e9;
const ll linf = 1LL << 50;
int n, m;
ll w[101][101][101];

ll dp[101][101][101];

int main(int argc, char const* argv[])
{
	cin >> n >> m;
	for(int i = 0; i < n; i++){
			int a, b, c;
			ll ww;
			cin >> a >> b >> c >> ww;
			w[a][b][c] = max(w[a][b][c], ww);
	}
	for(int i = 0; i < 101; i++){
			for(int j = 0; j < 101; j++){
					for(int k = 0; k < 101; k++){
							dp[i][j][k] = w[i][j][k];
							if(i > 0)dp[i][j][k] = max(dp[i][j][k], dp[i-1][j][k]);
							if(j > 0)dp[i][j][k] = max(dp[i][j][k], dp[i][j-1][k]);
							if(k > 0)dp[i][j][k] = max(dp[i][j][k], dp[i][j][k-1]);
					}
			}
	}
	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