제출 #887702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887702		votranngocvy	Knapsack (NOI18_knapsack)	C++14	49 / 100	1087 ms	2544 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

#define int long long
const int N = 1e5 + 5;
int w[N],v[N],k[N];
vector<int>dp_before(2005,0),dp_cur(2005,0);

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n,s;
    cin >> s >> n;
    for (int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> k[i];
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= s; j++) {
            dp_cur[j] = max(dp_cur[j],dp_before[j]);
            for (int z = 1; z <= min(s / w[i],k[i]); z++)
                if (j + w[i] * z <= s) 
                    dp_cur[j + w[i] * z] = max(dp_cur[j + w[i] * z],dp_before[j] + v[i] * z);
            ans = max(ans,dp_cur[j]);
        }
        dp_before = dp_cur;
    }
    cout << ans << "\n";
}

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