제출 #1165451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165451		enzy	Knapsack (NOI18_knapsack)	C++20	12 / 100	0 ms	328 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxs=2e3+10;
const int maxn=1e5+10;
int dp[maxs][2], v[maxn], w[maxn], k[maxn];
signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int s, n; cin >> s >> n;
    for(int i=1;i<=n;i++){
        cin >> v[i] >> w[i] >> k[i];
        for(int q=1;q<=k[i];q++){
            if(q*w[i]>s) break;
            for(int at=s;at>=q*w[i];at--) dp[at][(i%2)]=max({dp[at][(i%2)],dp[at][((i+1)%2)],dp[at-q*w[i]][((i+1)%2)]+q*v[i]});
        }
    }
    int resp=0;
    for(int i=0;i<=s;i++) resp=max({resp,dp[i][0],dp[i][1]});
    cout << resp << endl;
    return 0;
}

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