oj.uz

Submission #527383

# Submission time Handle Problem Language Result Execution time Memory
527383 2022-02-17T10:11:27 Z boris_mihov Knapsack (NOI18_knapsack) C++14
100 / 100
 83 ms 7472 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <vector>
#define int long long
using namespace std;
const int maxn = 1e5 + 10, maxs = 2e3 + 10, maxlog = 12;

int n, s;
struct item { int w, v, quantity; } items[maxn];
vector < pair < int, int > > by_w[maxs];
vector < pair < int, int > > sequence;
int dp[2][maxs];

void solve() {

    sequence.push_back({0, 0});
    for (int i = 1 ; i <= s ; ++i) {

        if (by_w[i].empty()) continue;
        sort(by_w[i].begin(), by_w[i].end(), greater < pair < int, int > > ());
        int cnt = 0, j = 0, currcnt;
        while (j < by_w[i].size() && cnt < s/i) {

            currcnt = 0;
            while (cnt < s/i && currcnt < by_w[i][j].second) {

                sequence.push_back({i, by_w[i][j].first});
                ++cnt;
                ++currcnt;

            }

            ++j;

        }

    }
    
    for (int ix = sequence.size()-1 ; ix >= 1 ; --ix)
        for (int taken = 0 ; taken <= s ; ++taken) {
        
            dp[ix&1][taken] = dp[(ix+1)&1][taken];
            if (taken + sequence[ix].first <= s) dp[ix&1][taken] = max(dp[ix&1][taken], dp[(ix+1)&1][taken + sequence[ix].first] + sequence[ix].second);
        
        }


    cout << dp[1][0] << '\n';

}

void fast_io() {

    ios_base :: sync_with_stdio(0);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cerr.tie(nullptr);

}

void read() {
    
    cin >> s >> n;
    for (int i = 1 ; i <= n ; ++i) {

        cin >> items[i].v >> items[i].w >> items[i].quantity;
        if (items[i].w <= s) by_w[items[i].w].push_back({items[i].v, items[i].quantity});

    }
}

signed main () {

    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);

    fast_io();
    read();
    solve();

    return 0;

}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:24:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         while (j < by_w[i].size() && cnt < s/i) {
      |                ~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 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 372 KB Output is correct
4 Correct 1 ms 360 KB Output is correct

Subtask #2
17.0 / 17.0

# 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 0 ms 368 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 376 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 364 KB Output is correct

Subtask #3
20.0 / 20.0

# 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 0 ms 368 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 376 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 364 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 5 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 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 368 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 368 KB Output is correct

Subtask #4
24.0 / 24.0

# 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 372 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 368 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 2 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 332 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 368 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 368 KB Output is correct
25 Correct 0 ms 372 KB Output is correct
26 Correct 7 ms 472 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 3 ms 380 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct

Subtask #5
27.0 / 27.0

# 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 372 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 368 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 5 ms 332 KB Output is correct
17 Correct 2 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 332 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 368 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 368 KB Output is correct
25 Correct 0 ms 372 KB Output is correct
26 Correct 7 ms 472 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 3 ms 380 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 28 ms 5396 KB Output is correct
36 Correct 34 ms 5696 KB Output is correct
37 Correct 35 ms 5416 KB Output is correct
38 Correct 35 ms 6008 KB Output is correct
39 Correct 38 ms 6620 KB Output is correct
40 Correct 83 ms 7472 KB Output is correct
41 Correct 55 ms 6636 KB Output is correct
42 Correct 78 ms 6724 KB Output is correct
43 Correct 75 ms 6704 KB Output is correct
44 Correct 72 ms 6652 KB Output is correct
45 Correct 39 ms 7108 KB Output is correct
46 Correct 35 ms 6376 KB Output is correct
47 Correct 46 ms 7364 KB Output is correct
48 Correct 60 ms 7288 KB Output is correct
49 Correct 32 ms 6856 KB Output is correct
50 Correct 61 ms 6796 KB Output is correct