Submission #19179350

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <chrono>

using namespace std;

bool w_compare(vector<int64_t> v, vector<int64_t> u) {
    return v[3] < u[3];
}

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int N, M; cin >> N >> M;
    vector<vector<int64_t>> abcw(N + 1, vector<int64_t>(4));
    abcw[0][0] = abcw[0][1] = abcw[0][2] = abcw[0][3] = 0;
    for (int i = 1; i <= N; i++) cin >> abcw[i][0] >> abcw[i][1] >> abcw[i][2] >> abcw[i][3];
    sort(abcw.begin(), abcw.end(), w_compare);
    
    vector<vector<vector<int>>> dp(101, vector<vector<int>>(101, vector<int>(101, N)));
    
    for (int i = 100; i >= 0; i--) {
        for (int j = 100; j >= 0; j--) {
            for (int k = 100; k >= 0; k--) {
                int cl = N;
                cl = min(cl, dp[i][j][min(100, k + 1)]);
                cl = min(cl, dp[i][min(100, j + 1)][k]);
                cl = min(cl, dp[min(100, i + 1)][j][k]);
                while (abcw[cl][0] > i || abcw[cl][1] > j || abcw[cl][2] > k) cl--;
                dp[i][j][k] = cl;
            }
        }
    }
    
    for (int i = 0; i < M; i++) {
        int x, y, z; cin >> x >> y >> z;
        cout << abcw[dp[x][y][z]][3] << endl;
    }
    
    return 0;
    
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:19:14: warning: unused parameter ‘argc’ [-Wunused-parameter]
   19 | int main(int argc, const char * argv[]) {
      |          ~~~~^~~~
./Main.cpp:19:33: warning: unused parameter ‘argv’ [-Wunused-parameter]
   19 | int main(int argc, const char * argv[]) {
      |                    ~~~~~~~~~~~~~^~~~~~

Judge Result