제출 #941691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
941691		yophis	Knapsack (NOI18_knapsack)	C++17	37 / 100	1051 ms	33980 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <cstdio>
#include <map>
#include <stack>
#include <numeric>
#include <queue>
#include <climits>


using namespace std;

using ll = long long;
using str = string;

using pii = pair<int, int>;
using pll = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;

#define all(x) begin(x), end(x)
#define lb lower_bound
#define ub upper_bound
#define pb push_back

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)


const int INF = 1e9;

void setIO(string filename = "") {
    ios_base::sync_with_stdio(false); cin.tie(0);
    if (filename.size()) {
        freopen((filename+".in").c_str(), "r", stdin);
        freopen((filename+".out").c_str(), "w", stdout);
    }
}

// =====================================

int n,s;

int main() {
    setIO();

    cin >> s >> n;
    vector<pii> v;
    FOR (i, 0, n) {
        int val, weight, cnt; cin>>val>>weight>>cnt;
        FOR (j, 0, cnt) v.pb({val, weight});
    }

    vl dp(s+1);
    for (auto &[val, weight]: v) {
        for (int i=s;i>=0;i--) {
            ll left = i - weight;
            if (left >= 0) {
                dp[i] = max(dp[i], dp[left] + val);
            }
        }
    }
    cout << dp[s] << '\n';
}

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

knapsack.cpp: In function 'void setIO(std::string)':
knapsack.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen((filename+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen((filename+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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