Submission #488660

#	Time	Username	Problem	Language	Result	Execution time	Memory
488660		Zybg	Knapsack (NOI18_knapsack)	C++11	73 / 100	454 ms	262148 KiB

knapsack

#include <iostream>
#include <algorithm>
using namespace std;

int s,n,v[100010],w[100010],k[100010]; 
int dp[100010][2010];

int main(){
	
	cin >> s >> n;
	for(int i=1;i<=n;i++){
		cin >> v[i] >> w[i] >> k[i];
	}
	for(int i=1;i<=n;i++){
		for(int j=s;j>=0;j--){
			int t = 0;
			while(j+t*w[i]<=s && t<=k[i]){
				dp[i][j] = max(dp[i-1][j+t*w[i]]+t*v[i],dp[i][j]);
				t++;
			}
		}
	}
	int ans = 0;
	for(int j=0;j<=s;j++){
		ans=max(ans,dp[n][j]);
	}
	cout << ans;
	
	return 0;
}

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