Submission #482670

#	Time	Username	Problem	Language	Result	Execution time	Memory
482670		Olympia	Knapsack (NOI18_knapsack)	C++17	0 / 100	2 ms	972 KiB

knapsack

#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
using namespace std;
#define ll long long
struct item {
    int weight;
    int worth;
};
int main() {
    int S, N;
    //S -> maximal weight; N -> number of items
    cin >> S >> N;
    vector<item> items;
    for (int i = 0; i < N; i++) {
        int wei, wor;
        cin >> wei >> wor;
        swap(wor, wei);
        int cnt;
        cin >> cnt;
        for (int j = 0; j < min(S/(wei * cnt), cnt); j++) {
            items.push_back({wei, wor});
        }
    }
    int dp[items.size() + 1][S + 1]; //taking i items, what is the best worth that we can get
    for (int i = 0; i < items.size() + 1; i++) {
        for (int j = 0; j <= S; j++) {
            dp[i][j] = 0;
        }
    }
    for (int i = 1; i <= items.size(); i++) {
        for (int j = 0; j <= S; j++) {
            if (j - items[i - 1].weight >= 0) {
                dp[i][j] = max(dp[i - 1][j - items[i - 1].weight] + items[i - 1].worth, dp[i - 1][j]);
            }
        }
    }
    cout << dp[items.size()][S] << endl;
}

Compilation message (stderr)

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

• Subtask 1: 0 / 12
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27