제출 #703297

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

knapsack

#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5+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 s,n, a[mxN], b[mxN], c[mxN], dp[mxN][2005];
void solve() {
	cin >> s >> n;
	for (int i = 1; i <= n; ++i) cin >> b[i] >> a[i] >> c[i];
	for (int i = 1; i <= n; ++i) {
		for (int w = 1; w <= s; ++w) {
			for (int j = 0; j <= c[i]; ++j) {
				if (j*a[i] <= w) dp[i][w] = max(dp[i][w], dp[i-1][w - j*a[i]] + j * b[i]);
			}
		}
	}
	cout << dp[n][s];
}
int main(){
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    // cin >> t;
    t = 1; 
    while(t--) {
    	solve();
    }
    return 0;
}

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