제출 #934115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
934115		KindaGoodGames	Knapsack (NOI18_knapsack)	C++14	37 / 100	1058 ms	476 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
int const INF = numeric_limits<int>::max() / 2;
#define ll long long 
string out = "";
bool hasCycles = false;
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tiii tuple<int,int,int>
#define tiid tuple<double,int,int>
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int s, n;
	cin >> s >> n;

	vector<int> weight, value, amt;
	weight = value = amt = vector<int>(n);
	for (int i = 0; i < n; i++) {
		cin >> value[i] >> weight[i] >> amt[i];
	}

	vector<ll> dp(s + 1);
	for (int j = 0; j < n; j++) {
		for (int i = s; i >= 0; i--) {

			for (int k = 0; k < amt[j]; k++) {
				if (weight[j] * (k + 1) > i) continue;
				dp[i] = max(dp[i], dp[i - ((k + 1) * weight[j])] + value[j] * (k + 1));
			}
		}
	}


	ll ma = 0;
	for (auto d : dp) {
		ma = max(ma, d);
	}

	cout << ma;
}

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