Submission #1131254

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131254		nlkn	Knapsack (NOI18_knapsack)	C++20	29 / 100	2 ms	328 KiB

knapsack

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

int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);	
	int n,m; cin >> m >> n;	
	int v[n],w[n],k[n];
	for(int i=0; i<n; i++)cin>>v[i]>>w[i]>>k[i];
	vector<int> prev(m+1);
	for(int j=0; j<=m; j++)prev[j]=0;
	for(int j=1; j<=k[0]&&j*w[0]<=m; j++){
		
		prev[j*w[0]]=v[0]*j;
	}
	//for(int j=0; j<=m; j++)cout<<dp[0][j]<<" ";
	//cout<<endl;
	for(int i=1; i<n; i++){
		vector<int> curr(m+1);
		for(int j=0; j<=m; j++)curr[j]=prev[j];
		int j=0;
		for(; j+k[i]*w[i]<=m; j++){
			for(int l=1; l<=k[i]&&j+l*w[i]<=m; l++){
				curr[j+l*w[i]]=max(curr[j+l*w[i]],prev[j]+v[i]*l);
			}
		}
		j++;
		for(; j+w[i]<=m; j++){
			curr[j+w[i]]=max(curr[j+w[i]],curr[j]+v[i]);
		}

		prev=curr;
		//for(int j=0; j<=m; j++)cout<<dp[i][j]<<" ";
		//cout<<endl;
	}
	int ans=0;
	for(int i=0; i<=m; i++)ans=max(ans,prev[i]);
	cout<<ans;
}

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