oj.uz

Submission #976131

# Submission time Handle Problem Language Result Execution time Memory
976131 2024-05-06T08:10:59 Z vjudge1 Knapsack (NOI18_knapsack) C++17
100 / 100
 120 ms 124240 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"

const int N = 2e3 + 5;

vector < pair < int, int > > a(1, {0, 0}), yes[N];

int n , s;

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

    cin >> s >> n;

    for ( int i = 1; i <= n; i++){
        int harga, berat, stok; cin >> harga >> berat >> stok;
        yes[berat].push_back({harga, stok});
    }

    for ( int i = 1; i <= 2000; i++) sort ( yes[i].begin(), yes[i].end(), greater<pair < int, int >>());

    for ( int i = 1; i <= 2000; i++){
        int can = 2000;

        for ( int j = 0; j < yes[i].size(); j++){
            for ( int k = 1; k <= yes[i][j].second; k++){
                if ( can - i < 0 ) break;
                a.push_back({i, yes[i][j].first});

                can -= i;
                // berat, harga
            }
        }
    }

    // 2e3 . log ( 2e3 ) . 2e3

    //for ( int i = 1; i < a.size(); i++) cout << a[i].first << " " << a[i].second <<  endl;
    //cout << endl;

    vector < vector < int > > dp ( a.size() + 5, vector < int > ( s + 5, 0 ));

    for ( int i = 1; i < a.size(); i++){
        for ( int j = 0; j <= s; j++){
            dp[i][j] = dp[i-1][j];
            if ( j >= a[i].first ){
                dp[i][j] = max ( dp[i][j], dp[i - 1][j - a[i].first] + a[i].second);
            }
        }
    }

    cout << dp[a.size() - 1][s];
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:27:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for ( int j = 0; j < yes[i].size(); j++){
      |                          ~~^~~~~~~~~~~~~~~
knapsack.cpp:45:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for ( int i = 1; i < a.size(); i++){
      |                      ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1196 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 6 ms 8028 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 2 ms 2140 KB Output is correct
20 Correct 2 ms 2012 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 1116 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 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1196 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 6 ms 8028 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 2140 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 2 ms 2140 KB Output is correct
24 Correct 2 ms 2012 KB Output is correct
25 Correct 1 ms 368 KB Output is correct
26 Correct 13 ms 16360 KB Output is correct
27 Correct 1 ms 1124 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 0 ms 616 KB Output is correct
30 Correct 4 ms 5476 KB Output is correct
31 Correct 1 ms 1128 KB Output is correct
32 Correct 1 ms 1384 KB Output is correct
33 Correct 2 ms 1968 KB Output is correct
34 Correct 2 ms 2396 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 1116 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 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1196 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 6 ms 8028 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 2140 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 2 ms 2140 KB Output is correct
24 Correct 2 ms 2012 KB Output is correct
25 Correct 1 ms 368 KB Output is correct
26 Correct 13 ms 16360 KB Output is correct
27 Correct 1 ms 1124 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 0 ms 616 KB Output is correct
30 Correct 4 ms 5476 KB Output is correct
31 Correct 1 ms 1128 KB Output is correct
32 Correct 1 ms 1384 KB Output is correct
33 Correct 2 ms 1968 KB Output is correct
34 Correct 2 ms 2396 KB Output is correct
35 Correct 23 ms 1496 KB Output is correct
36 Correct 39 ms 17112 KB Output is correct
37 Correct 33 ms 17128 KB Output is correct
38 Correct 27 ms 1496 KB Output is correct
39 Correct 28 ms 1360 KB Output is correct
40 Correct 120 ms 124240 KB Output is correct
41 Correct 73 ms 72840 KB Output is correct
42 Correct 75 ms 78392 KB Output is correct
43 Correct 110 ms 124176 KB Output is correct
44 Correct 108 ms 123712 KB Output is correct
45 Correct 36 ms 10480 KB Output is correct
46 Correct 29 ms 1532 KB Output is correct
47 Correct 39 ms 21172 KB Output is correct
48 Correct 69 ms 57412 KB Output is correct
49 Correct 24 ms 2296 KB Output is correct
50 Correct 83 ms 72164 KB Output is correct