Submission #19247708

---

Source Code Expand

#include <iostream>
#include <vector>

int N = 0, M = 0;
int dp[110][110][110] = {};

int main() {
	std::cin >> N >> M;

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

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

	for (int i = 0; i < M; i++)
	{
		int x, y, z;
		std::cin >> x >> y >> z;
		std::cout << dp[x][y][z] << std::endl;
	}

	return 0;
}

Submission Info

Judge Result