제출 #482678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482678		Olympia	Knapsack (NOI18_knapsack)	C++17	49 / 100	109 ms	262148 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 {
    long long weight;
    long long worth;
};
int main() {
    long long S, N;
    cin >> S >> N;
    vector<item> items;
    for (int i = 0; i < N; i++) {
        long long wei, wor;
        cin >> wor >> wei;
        long long cnt;
        cin >> cnt;
        for (int j = 0; j < min(cnt, S/wei); j++) {
            items.push_back({wei, wor});
        }
    }
    //reverse(items.begin(), items.end());
    long long 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(); i++) {
        for (int j = 0; j <= S; j++) {
            dp[i][j] = 0;
        }
    }
    long long myMax = 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]);
                myMax = max(myMax, dp[i][j]);
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    cout << myMax << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:34:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i = 0; i <= items.size(); 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: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27