Submission #1086122

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086122		lukasuliashvili	Knapsack (NOI18_knapsack)	C++17	73 / 100	96 ms	2412 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
const int N=10005;
long long  v[N],w[N],dp[N][N],k[N];
int main() {
	int s,n;
	cin>>s>>n;
	for(int i=1; i<=n; i++){
		cin>>v[i]>>w[i]>>k[i]; /// v[i]_value w[i]_weight 
	}


	for(int i=0; i<=n; i++){/// i_ramdeni itemi shedis j_ra masa eteva
		for(int j=0; j<=s; j++){
			if(i==0 or j==0 ){
				dp[i][j]=0;
				continue;
			}
			
			dp[i][j]=dp[i-1][j]; /// tu nivti ar aviget;
			for(int count=1; count<=k[i]; count++){
				if(j-count*w[i]<0) break;
				dp[i][j]=max(dp[i][j],dp[i-1][j-w[i]*count]+v[i]*count);
			}
		}
	}
	cout<<dp[n][s]<<endl;

}

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