Submission #8403764

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

#define REP(i,n)    for(int i = 0; i < (int)n; i++)
#define N_MAX   50000
#define M_MAX   50000
typedef long long    ll;


int N, M;
int a[N_MAX], b[N_MAX], c[N_MAX];
ll w[N_MAX];
int x[M_MAX], y[M_MAX], z[M_MAX];

bool workable(int i, int j){
    if(a[j] <= x[i] && b[j] <= y[i] && c[j] <= z[i])
        return true;
    else
        return false;
}

void solve (){
    ll dp[M_MAX][N_MAX + 1];
    REP(i,M){
        REP(j,N){
            if(workable(i, j))
                dp[i][j + 1] = max(dp[i][j], w[j]);
            else
                dp[i][j + 1] = dp[i][j];
        }
    }
    REP(i,M)
        cout << dp[i][N] << endl;
}

int main (){
    cin >> N >> M;
    REP(i,N)
        cin >> a[i] >> b[i] >> c[i] >> w[i];
    REP(i,M)
        cin >> x[i] >> y[i] >> z[i];
    
    solve();
    
    return 0;
}

Submission Info

Judge Result