oj.uz

Submission #985233

# Submission time Handle Problem Language Result Execution time Memory
985233 2024-05-17T13:28:47 Z Marcus Knapsack (NOI18_knapsack) C++17
100 / 100
 125 ms 36432 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long

void read() {freopen("input.txt", "r", stdin);}

int main() {
    //read();
    ll s, n; cin>>s>>n;
    map<ll, vector<pair<ll, ll>>> p;
    for (ll i=0; i<n; i++)
    {
        int v, w, c; cin>>v>>w>>c;
        p[w].push_back({v, c});
    }

    vector<vector<ll>> dp((ll)p.size()+1, vector<ll>(s+1, 0));
    ll ite = 1;
    for (auto &[w, items]: p)
    {
        sort(items.begin(), items.end(), greater<pair<ll, ll>>());
        for (ll x=1; x<=s; x++)
        {
            dp[ite][x] = dp[ite-1][x];
            ll copy = 0;
            ll item = 0;
            ll item_copy = 0;
            ll profit = 0;
            while((copy+1)*w <= x && item < items.size())
            {
                copy++;
                profit += items[item].first;
                dp[ite][x] = max(dp[ite][x], dp[ite-1][x-copy*w] + profit);
                
                item_copy++;
                if (item_copy == items[item].second) {item_copy = 0; item++;}
            }
        }
        ite++;
    }
    //for (auto u: dp[(ll)p.size()]) {cout<<u<<" ";}
    cout<<dp[(ll)p.size()][s];
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:29:43: 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]
   29 |             while((copy+1)*w <= x && item < items.size())
      |                                      ~~~~~^~~~~~~~~~~~~~
knapsack.cpp: In function 'void read()':
knapsack.cpp:5:21: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void read() {freopen("input.txt", "r", stdin);}
      |              ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 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 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 1976 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 2 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 492 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 1976 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 3 ms 432 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 4 ms 1880 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 2 ms 1968 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 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 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 1 ms 1884 KB Output is correct
12 Correct 1 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 492 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 1976 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 2 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 3 ms 432 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 4 ms 1880 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 1 ms 1880 KB Output is correct
33 Correct 2 ms 1968 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 55 ms 3280 KB Output is correct
36 Correct 64 ms 3520 KB Output is correct
37 Correct 58 ms 3280 KB Output is correct
38 Correct 63 ms 3764 KB Output is correct
39 Correct 102 ms 4300 KB Output is correct
40 Correct 125 ms 36432 KB Output is correct
41 Correct 98 ms 35628 KB Output is correct
42 Correct 98 ms 35664 KB Output is correct
43 Correct 106 ms 35744 KB Output is correct
44 Correct 104 ms 35412 KB Output is correct
45 Correct 89 ms 7952 KB Output is correct
46 Correct 78 ms 4040 KB Output is correct
47 Correct 90 ms 11368 KB Output is correct
48 Correct 102 ms 20408 KB Output is correct
49 Correct 75 ms 4944 KB Output is correct
50 Correct 92 ms 4688 KB Output is correct