oj.uz

Submission #553798

# Submission time Handle Problem Language Result Execution time Memory
553798 2022-04-27T06:15:41 Z thecodingwizard Knapsack (NOI18_knapsack) C++11
100 / 100
 140 ms 67552 KB 
#include <bits/stdc++.h>

#ifdef VSLOCAL
#include "debug/d.h"
#endif
#ifdef LOCAL
#include "../../debug/d.h"
#endif

using namespace std;

using ll = long long;
using ld = long double;

#if defined(LOCAL) || defined(VSLOCAL)
#define dbg(...) line_info(__LINE__, #__VA_ARGS__), dbg1(__VA_ARGS__)
void nline() { cerr << '\n'; }
#else
#define dbg(...) 0
void nline() {}
#endif

struct item {
    ll W, V, K;
    bool operator< (const item that) const {
        return (W == that.W) ? V > that.V : W < that.W;
    }
};

ostream& operator<< (ostream& out, item i) {
    out << "{" << i.V << ", " << i.W << ", " << i.K << "}";
    return out;
}

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

    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("log.txt", "w", stderr);
    #endif

    int S, N;
    cin >> S >> N;

    vector<item> items (N);
    for (int i = 0; i < N; ++i) {
        cin >> items[i].V >> items[i].W >> items[i].K;
    }

    sort(items.begin(), items.end());
    dbg(items);

    vector<vector<ll>> value (S + 1, vector<ll> (S + 1));
    vector<vector<ll>> dp (S + 1, vector<ll> (S + 1)); // maximum value

    int index = 0;
    for (int i = 1; i <= S; ++i) {
        int count = 0;
        dp[i] = dp[i - 1];
        while (index < items.size() && items[index].W < i) index++;
        if (index >= items.size() || items[index].W > i) continue;
        for (int j = i; j <= S; j += i) {
            count++;
            if (count > items[index].K) {
                count = 1;
                index++;
            }
            if (index >= N || items[index].W != i) break;
            value[i][j] = value[i][j - i] + items[index].V;

            for (int k = j; k <= S; ++k) {
                // dp[i][k] = max(dp[i][k], dp[i - 1][k]);
                dp[i][k] = max(dp[i][k], dp[i][k - 1]);
                dp[i][k] = max(dp[i][k], dp[i - 1][k - j] + value[i][j]);
            }
        }
    }
    dbg(dp);
    cout << dp[S][S] << '\n';
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:19:18: warning: statement has no effect [-Wunused-value]
   19 | #define dbg(...) 0
      |                  ^
knapsack.cpp:52:5: note: in expansion of macro 'dbg'
   52 |     dbg(items);
      |     ^~~
knapsack.cpp:61:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |         while (index < items.size() && items[index].W < i) index++;
      |                ~~~~~~^~~~~~~~~~~~~~
knapsack.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |         if (index >= items.size() || items[index].W > i) continue;
      |             ~~~~~~^~~~~~~~~~~~~~~
knapsack.cpp:19:18: warning: statement has no effect [-Wunused-value]
   19 | #define dbg(...) 0
      |                  ^
knapsack.cpp:79:5: note: in expansion of macro 'dbg'
   79 |     dbg(dp);
      |     ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24248 KB Output is correct
2 Correct 12 ms 24276 KB Output is correct
3 Correct 13 ms 24276 KB Output is correct
4 Correct 12 ms 24276 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 32 ms 63072 KB Output is correct
3 Correct 34 ms 63004 KB Output is correct
4 Correct 37 ms 62780 KB Output is correct
5 Correct 32 ms 62876 KB Output is correct
6 Correct 35 ms 63088 KB Output is correct
7 Correct 31 ms 63028 KB Output is correct
8 Correct 33 ms 62896 KB Output is correct
9 Correct 37 ms 62856 KB Output is correct
10 Correct 38 ms 63008 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 32 ms 63072 KB Output is correct
3 Correct 34 ms 63004 KB Output is correct
4 Correct 37 ms 62780 KB Output is correct
5 Correct 32 ms 62876 KB Output is correct
6 Correct 35 ms 63088 KB Output is correct
7 Correct 31 ms 63028 KB Output is correct
8 Correct 33 ms 62896 KB Output is correct
9 Correct 37 ms 62856 KB Output is correct
10 Correct 38 ms 63008 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 41 ms 63136 KB Output is correct
13 Correct 37 ms 62912 KB Output is correct
14 Correct 36 ms 63048 KB Output is correct
15 Correct 34 ms 62976 KB Output is correct
16 Correct 36 ms 63200 KB Output is correct
17 Correct 33 ms 62912 KB Output is correct
18 Correct 31 ms 62924 KB Output is correct
19 Correct 34 ms 63120 KB Output is correct
20 Correct 33 ms 62932 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24248 KB Output is correct
2 Correct 12 ms 24276 KB Output is correct
3 Correct 13 ms 24276 KB Output is correct
4 Correct 12 ms 24276 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 32 ms 63072 KB Output is correct
7 Correct 34 ms 63004 KB Output is correct
8 Correct 37 ms 62780 KB Output is correct
9 Correct 32 ms 62876 KB Output is correct
10 Correct 35 ms 63088 KB Output is correct
11 Correct 31 ms 63028 KB Output is correct
12 Correct 33 ms 62896 KB Output is correct
13 Correct 37 ms 62856 KB Output is correct
14 Correct 38 ms 63008 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 41 ms 63136 KB Output is correct
17 Correct 37 ms 62912 KB Output is correct
18 Correct 36 ms 63048 KB Output is correct
19 Correct 34 ms 62976 KB Output is correct
20 Correct 36 ms 63200 KB Output is correct
21 Correct 33 ms 62912 KB Output is correct
22 Correct 31 ms 62924 KB Output is correct
23 Correct 34 ms 63120 KB Output is correct
24 Correct 33 ms 62932 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 48 ms 63000 KB Output is correct
27 Correct 34 ms 63136 KB Output is correct
28 Correct 33 ms 63000 KB Output is correct
29 Correct 37 ms 62996 KB Output is correct
30 Correct 34 ms 63056 KB Output is correct
31 Correct 37 ms 63096 KB Output is correct
32 Correct 31 ms 62984 KB Output is correct
33 Correct 34 ms 62876 KB Output is correct
34 Correct 36 ms 62932 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24248 KB Output is correct
2 Correct 12 ms 24276 KB Output is correct
3 Correct 13 ms 24276 KB Output is correct
4 Correct 12 ms 24276 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 32 ms 63072 KB Output is correct
7 Correct 34 ms 63004 KB Output is correct
8 Correct 37 ms 62780 KB Output is correct
9 Correct 32 ms 62876 KB Output is correct
10 Correct 35 ms 63088 KB Output is correct
11 Correct 31 ms 63028 KB Output is correct
12 Correct 33 ms 62896 KB Output is correct
13 Correct 37 ms 62856 KB Output is correct
14 Correct 38 ms 63008 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 41 ms 63136 KB Output is correct
17 Correct 37 ms 62912 KB Output is correct
18 Correct 36 ms 63048 KB Output is correct
19 Correct 34 ms 62976 KB Output is correct
20 Correct 36 ms 63200 KB Output is correct
21 Correct 33 ms 62912 KB Output is correct
22 Correct 31 ms 62924 KB Output is correct
23 Correct 34 ms 63120 KB Output is correct
24 Correct 33 ms 62932 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 48 ms 63000 KB Output is correct
27 Correct 34 ms 63136 KB Output is correct
28 Correct 33 ms 63000 KB Output is correct
29 Correct 37 ms 62996 KB Output is correct
30 Correct 34 ms 63056 KB Output is correct
31 Correct 37 ms 63096 KB Output is correct
32 Correct 31 ms 62984 KB Output is correct
33 Correct 34 ms 62876 KB Output is correct
34 Correct 36 ms 62932 KB Output is correct
35 Correct 31 ms 3668 KB Output is correct
36 Correct 81 ms 66640 KB Output is correct
37 Correct 79 ms 66516 KB Output is correct
38 Correct 64 ms 66736 KB Output is correct
39 Correct 72 ms 67308 KB Output is correct
40 Correct 140 ms 67528 KB Output is correct
41 Correct 111 ms 66760 KB Output is correct
42 Correct 125 ms 66696 KB Output is correct
43 Correct 136 ms 66820 KB Output is correct
44 Correct 135 ms 66520 KB Output is correct
45 Correct 79 ms 67532 KB Output is correct
46 Correct 62 ms 67344 KB Output is correct
47 Correct 88 ms 67540 KB Output is correct
48 Correct 105 ms 67552 KB Output is correct
49 Correct 67 ms 67236 KB Output is correct
50 Correct 113 ms 67296 KB Output is correct