oj.uz

Submission #975084

# Submission time Handle Problem Language Result Execution time Memory
975084 2024-05-04T11:50:01 Z allw Knapsack (NOI18_knapsack) C++17
100 / 100
 127 ms 8848 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>

int main() {
    int s, n; std::cin >> s >> n;
    std::vector<std::vector<int>> items(n, std::vector<int>(3));

    // s in [1, 2000]
    for (int i = 0; i < n; ++i) {
        std::cin >> items[i][0] >> items[i][1] >> items[i][2];
        // cost, weight, count
    }

    std::sort(items.begin(), items.end(), std::greater<std::vector<int>>());

    std::vector<std::vector<int>> a(2001, std::vector<int>());
    for (int i = 0; i < n; ++i) {
        int cnt = items[i][2];
        int w = items[i][1];
        int max_items = 2000 / w;

        while (cnt > 0 && a[w].size() < max_items) {
            a[w].push_back(items[i][0]);
            cnt--;
        }
    }

    std::vector<std::vector<int>> items2;
    for (int i = 0; i < a.size(); ++i) {
        for (int j = 0; j < a[i].size(); ++j) {
            items2.push_back({i, a[i][j]});
            // w, cost
        }
    }

    std::vector<int> dp(s + 1, INT_MIN);
    dp[0] = 0;

    for (int i = 0; i < items2.size(); ++i) {
        int w = items2[i][0];
        int c = items2[i][1];
        std::vector<int> new_dp = dp;

        for (int j = 0; j < dp.size(); ++j) {
            if (dp[j] >= 0 && j + w < dp.size()) {
                new_dp[j + w] = std::max(new_dp[j + w], dp[j] + c);
            }
        }

        dp = new_dp;
    }

    int mmax = 0;
    for (int i = 0; i < dp.size(); ++i) {
        mmax = std::max(dp[i], mmax);
    }

    std::cout << mmax << '\n';
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:24:39: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         while (cnt > 0 && a[w].size() < max_items) {
      |                           ~~~~~~~~~~~~^~~~~~~~~~~
knapsack.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~
knapsack.cpp:32:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         for (int j = 0; j < a[i].size(); ++j) {
      |                         ~~^~~~~~~~~~~~~
knapsack.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for (int i = 0; i < items2.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~
knapsack.cpp:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int j = 0; j < dp.size(); ++j) {
      |                         ~~^~~~~~~~~~~
knapsack.cpp:47:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             if (dp[j] >= 0 && j + w < dp.size()) {
      |                               ~~~~~~^~~~~~~~~~~
knapsack.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < dp.size(); ++i) {
      |                     ~~^~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 63 ms 6996 KB Output is correct
36 Correct 91 ms 7248 KB Output is correct
37 Correct 67 ms 6924 KB Output is correct
38 Correct 71 ms 7252 KB Output is correct
39 Correct 94 ms 8016 KB Output is correct
40 Correct 127 ms 8848 KB Output is correct
41 Correct 92 ms 7972 KB Output is correct
42 Correct 93 ms 7824 KB Output is correct
43 Correct 107 ms 8120 KB Output is correct
44 Correct 107 ms 8132 KB Output is correct
45 Correct 103 ms 8020 KB Output is correct
46 Correct 91 ms 7816 KB Output is correct
47 Correct 99 ms 8060 KB Output is correct
48 Correct 112 ms 8272 KB Output is correct
49 Correct 103 ms 7928 KB Output is correct
50 Correct 122 ms 8440 KB Output is correct