제출 #703288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
703288		pahn	Knapsack (NOI18_knapsack)	C++14	37 / 100	1077 ms	2264 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e3+5;
const int M = 1e9+7;
using vi = vector<int>;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define el '\n'
ll n, m;
ll a[mxN], b[mxN], c[mxN];
ll dp[mxN][10005];
int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> m >> n;
    for (int i = 1; i <= n; ++i) {
    	cin >> b[i] >> a[i] >> c[i];
	}
    for (int i = 1; i <= n; ++i) {
    	for (int j = 1; j <= m; ++j) {
    		for (int z = 0; z <= c[i]; ++z){
    			if (z*a[i] <= j) dp[i][j] = max(dp[i][j], dp[i-1][j - z*a[i]] + b[i]*z);
    		}
		}
	}
	cout << dp[n][m];
}

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