Submission #405084

# Submission time Handle Problem Language Result Execution time Memory
405084 2021-05-15T16:49:16 Z Falcon Knapsack (NOI18_knapsack) C++17
100 / 100
82 ms 3736 KB
#include <bits/stdc++.h>

#ifdef DEBUG
#include "debug.hpp"
#endif

using namespace std;

#define all(c)              (c).begin(), (c).end()
#define rall(c)             (c).rbegin(), (c).rend()
#define traverse(c, it)     for(auto it = (c).begin(); it != (c).end(); ++it)
#define rep(i, N)           for(int i = 0; i < (N); ++i)
#define rrep(i, N)          for(int i = (N) - 1; i >= 0; --i)
#define rep1(i, N)          for(int i = 1; i <= (N); ++i)
#define rep2(i, s, e)       for(int i = (s); i <= (e); ++i)

#ifdef DEBUG
#define debug(x...)         { \
                            ++dbg::depth; \
                            string dbg_vals = dbg::to_string(x); \
                            --dbg::depth; \
                            dbg::fprint(__func__, __LINE__, #x, dbg_vals); \
                            }

#define light_debug(x)      { \
                            dbg::light = true; \
                            dbg::dout << __func__ << ":" << __LINE__; \
                            dbg::dout << "  " << #x << " = " << x << endl; \
                            dbg::light = false; \
                            }

#else
#define debug(x...)         42
#define light_debug(x)      42
#endif


using ll = long long;

template<typename T>
inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }

template<typename T>
inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int s, n; cin >> s >> n;

    vector<vector<pair<int, int>>> best(s + 1);
    rep(_, n) {
        int v, w, k; cin >> v >> w >> k;
        best[w].push_back({v, k});
    }

    rep1(w, s) {
        sort(all(best[w]), greater<pair<int, int>>());
        int c{s / w};
        for(auto i = best[w].begin(); i != best[w].end(); ++i) {
            if(c >= i->second) c -= i->second;
            else { 
                i->second = c;
                best[w].erase(i + 1, best[w].end());
                break; 
            }
        }
    }

    debug(best);

    vector<long long> dp(s + 1, -1); dp[0] = 0;
    rep1(w, s) {
        for(auto [v, k] : best[w])
            for(int i{1}; i <= k; i++)
                for(int x{s - w}; x >= 0; --x)
                    if(~dp[x]) ckmax(dp[x + w], dp[x] + v);
    }

    cout << *max_element(all(dp)) << '\n';
    
    
    #ifdef DEBUG
    dbg::dout << "\nExecution time: "
              << clock() * 1000 / CLOCKS_PER_SEC 
              << "ms" << endl;
    #endif
    return 0;
}


Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:33:29: warning: statement has no effect [-Wunused-value]
   33 | #define debug(x...)         42
      |                             ^~
knapsack.cpp:72:5: note: in expansion of macro 'debug'
   72 |     debug(best);
      |     ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 2 ms 312 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 2 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 312 KB Output is correct
23 Correct 2 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 6 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 308 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 312 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 35 ms 2252 KB Output is correct
36 Correct 43 ms 2524 KB Output is correct
37 Correct 40 ms 2328 KB Output is correct
38 Correct 37 ms 2712 KB Output is correct
39 Correct 45 ms 3360 KB Output is correct
40 Correct 82 ms 3532 KB Output is correct
41 Correct 57 ms 2828 KB Output is correct
42 Correct 59 ms 2828 KB Output is correct
43 Correct 76 ms 2788 KB Output is correct
44 Correct 75 ms 2732 KB Output is correct
45 Correct 44 ms 3564 KB Output is correct
46 Correct 42 ms 3188 KB Output is correct
47 Correct 48 ms 3736 KB Output is correct
48 Correct 64 ms 3520 KB Output is correct
49 Correct 41 ms 3332 KB Output is correct
50 Correct 64 ms 3320 KB Output is correct