oj.uz

Submission #524137

# Submission time Handle Problem Language Result Execution time Memory
524137 2022-02-08T17:08:39 Z shubham20_03 Knapsack (NOI18_knapsack) C++17
100 / 100
 91 ms 19404 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define deb(x) cout<<#x<<'='<<x<<'\n';
#define deb2(x,y) cout<<#x<<'='<<x<<", "<<#y<<'='<<y<<'\n';
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
const long double PI = acos(-1);
const int mod = 1e9 + 7;

// usaco guide
signed main() {
    fastio

    int S, N; cin >> S >> N;
    map<int, vector<pii>> bywt;
    for (int i = 0; i < N; i++) {
        int v, w, k; cin >> v >> w >> k;
        bywt[w].pb({v, k});
    }

    int dp[sz(bywt) + 1][S + 1];
    memset (dp, -1, sizeof(dp));

    dp[0][0] = 0;
    int at = 1;
    for (auto& pp : bywt) {
        int w = pp.f;
        vector<pii>& itms = pp.s;
        sort(all(itms));
        reverse(all(itms));

        for (int j = 0; j <= S; j++) {
            dp[at][j] = dp[at - 1][j];

            int copies = 0;
            int type_at = 0;
            int prof = 0;
            int cur_used = 0;
            while ((copies + 1) * w <= j and type_at < sz(itms)) {
                copies++;
                prof += itms[type_at].f;
                if (dp[at - 1][j - w * copies] != -1)
                    dp[at][j] = max(dp[at][j], dp[at - 1][j - w * copies] + prof);

                cur_used++;
                if (cur_used == itms[type_at].s) {
                    cur_used = 0;
                    type_at++;
                }
            }
        }

        at++;
    }

    int ans = 0;
    for (int j = 1; j <= S; j++)
        ans = max(ans, dp[at - 1][j]);
    cout << ans << '\n';

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 3 ms 204 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 2 ms 972 KB Output is correct
17 Correct 1 ms 944 KB Output is correct
18 Correct 1 ms 972 KB Output is correct
19 Correct 2 ms 972 KB Output is correct
20 Correct 2 ms 972 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 204 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 2 ms 972 KB Output is correct
21 Correct 1 ms 944 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 972 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 3 ms 972 KB Output is correct
31 Correct 1 ms 1100 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 2 ms 956 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 1 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 204 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 2 ms 972 KB Output is correct
21 Correct 1 ms 944 KB Output is correct
22 Correct 1 ms 972 KB Output is correct
23 Correct 2 ms 972 KB Output is correct
24 Correct 2 ms 972 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 3 ms 972 KB Output is correct
31 Correct 1 ms 1100 KB Output is correct
32 Correct 1 ms 972 KB Output is correct
33 Correct 2 ms 972 KB Output is correct
34 Correct 2 ms 956 KB Output is correct
35 Correct 36 ms 2308 KB Output is correct
36 Correct 31 ms 2456 KB Output is correct
37 Correct 28 ms 2244 KB Output is correct
38 Correct 35 ms 2580 KB Output is correct
39 Correct 36 ms 3352 KB Output is correct
40 Correct 91 ms 19404 KB Output is correct
41 Correct 70 ms 18688 KB Output is correct
42 Correct 88 ms 18616 KB Output is correct
43 Correct 85 ms 18712 KB Output is correct
44 Correct 87 ms 18628 KB Output is correct
45 Correct 46 ms 5180 KB Output is correct
46 Correct 33 ms 3148 KB Output is correct
47 Correct 50 ms 6756 KB Output is correct
48 Correct 60 ms 11388 KB Output is correct
49 Correct 31 ms 3652 KB Output is correct
50 Correct 59 ms 3552 KB Output is correct