oj.uz

Submission #373388

# Submission time Handle Problem Language Result Execution time Memory
373388 2021-03-04T12:05:54 Z arujbansal Knapsack (NOI18_knapsack) C++17
100 / 100
 70 ms 5480 KB 
#include <bits/stdc++.h>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> 
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using ll = long long;

const int MAXN = 1e5 + 5;
const ll INF = 1e18;

void subtask4() {
    int N, S;
    cin >> S >> N;

    vector<pair<ll, ll>> items;

    for (int i = 0; i < N; i++) {
        ll V, W, K;
        cin >> V >> W >> K;

        if (W > S) continue;

        ll inc = 1;
        while (inc <= K) {
            items.emplace_back(V * inc, W * inc);
            inc *= 2;
        }

        items.pop_back();

        inc /= 2;
        inc--;

        if (K == inc) continue;
        items.emplace_back(V * (K - inc), W * (K - inc));
    }

    vector<ll> dp(S + 1, -INF);
    dp[0] = 0;

    for (const auto &[val, wt] : items) {
        if (S - wt < 0) continue;
        for (int i = S - wt; i >= 0; i--) {
            dp[i + wt] = max(dp[i + wt], dp[i] + val);
        }
    }

    cout << *max_element(all(dp));
}

void solve() {
    int N, S;
    cin >> S >> N;

    vector<pair<ll, ll>> A[S + 1];

    for (int i = 0; i < N; i++) {
        ll V, W, K;
        cin >> V >> W >> K;

        A[W].emplace_back(V, K);
    }

    vector<pair<ll, ll>> items;

    for (int i = 1; i <= S; i++) {
        sort(all(A[i]), greater<>());

        int take = S / i + 1, j = 0;
        while (take && j < sz(A[i])) {
            if (A[i][j].second == 0) {
                j++;
                continue;
            }

            A[i][j].second--;
            take--;
            items.emplace_back(A[i][j].first, i);
        }
    }

    vector<ll> dp(S + 1, -INF);
    dp[0] = 0;

    for (const auto &[val, wt] : items) {
        if (S - wt < 0) continue;
        for (int i = S - wt; i >= 0; i--) {
            dp[i + wt] = max(dp[i + wt], dp[i] + val);
        }
    }

    cout << *max_element(all(dp));
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // subtask4();
    solve();
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 380 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 4 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 37 ms 3432 KB Output is correct
36 Correct 43 ms 3560 KB Output is correct
37 Correct 37 ms 3452 KB Output is correct
38 Correct 36 ms 3788 KB Output is correct
39 Correct 44 ms 4380 KB Output is correct
40 Correct 69 ms 5480 KB Output is correct
41 Correct 57 ms 4460 KB Output is correct
42 Correct 51 ms 4460 KB Output is correct
43 Correct 65 ms 4712 KB Output is correct
44 Correct 70 ms 4712 KB Output is correct
45 Correct 42 ms 4844 KB Output is correct
46 Correct 41 ms 4072 KB Output is correct
47 Correct 46 ms 5100 KB Output is correct
48 Correct 53 ms 4972 KB Output is correct
49 Correct 40 ms 4588 KB Output is correct
50 Correct 56 ms 4588 KB Output is correct