제출 #887699

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
887699		votranngocvy	Knapsack (NOI18_knapsack)	C++14	73 / 100	181 ms	4104 KiB

knapsack

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

#define int long long
const int N = 1e5 + 5;
int dp[105][2005],w[N],v[N],k[N];

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];
    if (n <= 100) {
        int ans = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 0; j <= s; j++) {
                dp[i][j] = max(dp[i][j],dp[i - 1][j]);
                for (int z = 1; z <= min(s / w[i],k[i]); z++)
                    if (j + w[i] * z <= s) 
                        dp[i][j + w[i] * z] = max(dp[i][j + w[i] * z],dp[i - 1][j] + v[i] * z);
                ans = max(ans,dp[i][j]);
            }
        cout << ans << "\n";
    }
}

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