Submission #2167913

---

Source Code Expand

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr long long MOD = 1000000000 + 7;
constexpr long long INF = 1e17 - 10;
const double PI = acos(-1);
#define fir first
#define sec second
typedef pair<LL, LL> Pll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Mfor(i,mf) for(LL i=mf-1;i>=0;i--)
LL h, w, n, m, s, t, q, ans, sum,a[101][101][101],
dp[101][101][101], last;
struct Edge { LL to,cost; };
string str, ss;
pair<char,int> c[1000];
vector<char>v;
bool f[100];
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
int main() {
	cin >> n >> m;
	rep(i, n) {
		LL x, y, z, w;
		cin >> x >> y >> z >> w;
		a[x][y][z] = max(a[x][y][z], w);
	}
	rep(i, 101) {
		rep(j, 101) {
			rep(k, 101) {
				if(i>=1&&j>=1&&k>=1)
				dp[i][j][k] = max({ dp[i][j][k], a[i][j][k],dp[i - 1][j][k],dp[i][j - 1][k],dp[i][j][k - 1] });
			}
		}
	}
	rep(i, m) {
		LL x, y, z;
		cin >> x >> y >> z;
		cout << dp[x][y][z] << endl;
	}
	return 0;
}

Submission Info

Judge Result