제출 #794190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
794190		jared	Knapsack (NOI18_knapsack)	C++17	37 / 100	122 ms	262144 KiB

knapsack

#include <bits/stdc++.h>

#ifdef LOCAL_TEST

#include "debugging.h"

#endif

#ifndef LOCAL_TEST

#define endl '\n'

#endif

using namespace std;

void setio(string filename) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    if (getenv("stdio")) filename = "";
    else if (getenv("local_test")) filename = "test";

    if (!filename.empty()) {
        freopen((filename + ".in").c_str(), "r", stdin);
        freopen((filename + ".out").c_str(), "w", stdout);
    }
}

const int MAX_N = 1e5, MAX_S = 2000;
int s, n, v[MAX_N], w[MAX_N], prek[MAX_N], dp[MAX_N + 1][MAX_S + 1];

int ptr = 0, cnt = 0;
pair<int, int> next_item() {
    cnt++;
    if (cnt > prek[ptr]) ptr++;
    return {v[ptr], w[ptr]};
}

int main() {
    setio("");

    cin >> s >> n;
    for (int i = 0; i < n; ++i) {
        cin >> v[i] >> w[i] >> prek[i];

        if (i > 0) prek[i] += prek[i - 1];
    }

    for (int i = 1; i <= prek[n - 1]; ++i) { // item index
        auto [cur_v, cur_w] = next_item();

        for (int j = 0; j <= s; ++j) { // weight
            dp[i][j] = max(dp[i - 1][j],
                           j - cur_w >= 0 ? dp[i - 1][j - cur_w] + cur_v : -1);
        }
    }
    cout << dp[prek[n - 1]][s];
}

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

knapsack.cpp: In function 'void setio(std::string)':
knapsack.cpp:25:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |         freopen((filename + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:26:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |         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