oj.uz

Submission #961899

# Submission time Handle Problem Language Result Execution time Memory
961899 2024-04-12T17:28:12 Z Br3ad Knapsack (NOI18_knapsack) C++14
100 / 100
 44 ms 4984 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;
#define ll long long
#define ull unsigned long long
#define f first
#define s second
#define PB push_back
#define MP make_pair
#define max(a, b) ((a > b)? a : b)
#define min(a, b) ((a < b)? a : b)

const int N = 1e5 + 5;
const int M = 1e9 + 7; 
const int INF = 0x3f3f3f3f;
const int MAXS = 2e3 + 5;

int main(){
    
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    // ifstream cin();
    // ofstream cout();
    
    int S, n, v[N], w[N], k[N];
    cin >> S >> n;
    for(int i = 0; i < n; i++){
        cin >> v[i] >> w[i] >> k[i];
    }

    // Group same weight
    vector<pair<int, int>> item[MAXS];
    for(int i = 0; i < n; i++){
        item[w[i]].PB(MP(v[i], k[i]));
    }

    // Final consideration array
    vector<pair<int, int>> arr;
    for(int i = 1; i <= S; i++){
        if(item[i].empty()) continue;
        sort(item[i].rbegin(), item[i].rend());
        int num = (S/i); // Can only take this quantity of current weight
        for(pair<int, int> p : item[i]){
            for(int k = 0; k < min(num, p.s); k++){
                // Pushback {Weight, Value}
                arr.PB(MP(i, p.f));
            }
            num -= p.s;
            if(num <= 0) break;
        }
    }

    // Start DP
    int dp[MAXS]{0};
    for(int i = 0; i < arr.size(); i++){
        for(int j = S; j >= arr[i].f; j--){
            dp[j] = max(dp[j], dp[j - arr[i].f] + arr[i].s);
        }
    }

    cout << dp[S] << endl;
}

Compilation message

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

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1680 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1628 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
11 Correct 1 ms 1624 KB Output is correct
12 Correct 1 ms 1628 KB Output is correct
13 Correct 1 ms 1628 KB Output is correct
14 Correct 1 ms 1628 KB Output is correct
15 Correct 1 ms 1628 KB Output is correct
16 Correct 3 ms 1680 KB Output is correct
17 Correct 1 ms 1844 KB Output is correct
18 Correct 1 ms 1684 KB Output is correct
19 Correct 2 ms 1624 KB Output is correct
20 Correct 2 ms 1680 KB Output is correct
21 Correct 1 ms 1624 KB Output is correct
22 Correct 1 ms 1628 KB Output is correct
23 Correct 1 ms 1628 KB Output is correct
24 Correct 1 ms 1628 KB Output is correct
25 Correct 1 ms 1624 KB Output is correct
26 Correct 4 ms 1624 KB Output is correct
27 Correct 1 ms 1676 KB Output is correct
28 Correct 1 ms 1624 KB Output is correct
29 Correct 1 ms 1628 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 1 ms 1628 KB Output is correct
32 Correct 1 ms 1628 KB Output is correct
33 Correct 1 ms 1628 KB Output is correct
34 Correct 1 ms 1628 KB Output is correct
35 Correct 23 ms 3716 KB Output is correct
36 Correct 27 ms 4048 KB Output is correct
37 Correct 27 ms 3800 KB Output is correct
38 Correct 27 ms 4280 KB Output is correct
39 Correct 27 ms 4644 KB Output is correct
40 Correct 44 ms 4984 KB Output is correct
41 Correct 32 ms 4356 KB Output is correct
42 Correct 32 ms 4248 KB Output is correct
43 Correct 40 ms 4176 KB Output is correct
44 Correct 41 ms 4184 KB Output is correct
45 Correct 27 ms 4864 KB Output is correct
46 Correct 27 ms 4712 KB Output is correct
47 Correct 29 ms 4952 KB Output is correct
48 Correct 37 ms 4948 KB Output is correct
49 Correct 25 ms 4688 KB Output is correct
50 Correct 42 ms 4816 KB Output is correct