제출 #776956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
776956		qenneth	Knapsack (NOI18_knapsack)	C++17	73 / 100	250 ms	262144 KiB

knapsack

#pragma GCC optimize("O3")
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define all(x) x.begin(), x.end()
#define chmax(x, a) x = max(x, a);
#define chmin(x, a) x = min(x, a);

// usaco
void setIO(string s) {
	freopen((s + ".in").c_str(), "r", stdin);
	freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;

int main() {
	FASTIO;
	// setIO("snakes");
	int s, n;
	cin >> s >> n;
	vector<vector<int>> a(n, vector<int>(3, 0));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 3; j++) {
			cin >> a[i][j];
		}
	}
	vector<vector<long long>> dp(n + 1, vector<long long> (s + 1));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j <= s; j++) {
			// if (dp[i][j] == -1) continue;
			dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
			for (int k = 0; k <= min(s, a[i][2]); k++) {
				if (j + k * a[i][1] <= s) {
					dp[i + 1][j + k * a[i][1]] = max(dp[i + 1][j + k * a[i][1]], dp[i][j] + 1ll * k * a[i][0]);
				}
			}
		}
	}
	cout << dp[n][s] << "\n";
}

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

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

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