Submission #2972115

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
#define vunique(v) unique(v.begin(), v.end())
#define mp make_pair
#define ts(x) to_string(x)
#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)
#define repm(i, a, b) for(int i = (int)a; i > (int)b; i--)
#define bit(a) bitset<8>(a)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

int N, M;
int a[50001], b[50001], c[50001], w[50001];
int x[50001], y[50001], z[50001];

void solve(int m) {
	int dp[N + 1][2][2][2] = {};
	rep(i, 0, N) rep(j, 0, 2) rep(k, 0, 2) rep(l, 0, 2) {
		int cost = (x[m] >= a[i] && y[m] >= b[i] && z[m] >= c[i]) ? w[i] : 0;
		dp[i + 1][j || x[m] >= a[i]][k || y[m] >= b[i]][l || z[m] >= c[i]] = max(dp[i][j][k][l], cost);
	}
	int ans = 0;
	rep(i, 0, N) ans = max(ans, dp[i + 1][1][1][1]);
	cout << ans << endl;
}
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N >> M;
	rep(i, 0, N) cin >> a[i] >> b[i] >> c[i] >> w[i];
	rep(i, 0, M) cin >> x[i] >> y[i] >> z[i];

	rep(m, 0, M) {
		solve(m);
	}
}

Submission Info

Judge Result