제출 #652326

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
652326		lam	Knapsack (NOI18_knapsack)	C++14	12 / 100	1 ms	340 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
#define taskname "feast"
using namespace std;
const int maxn = 1e6 + 10;
typedef pair<int,int> ii;
#define ff first
#define ss second
int x,n;
int v[maxn],w[maxn],k[maxn];
ii dp[maxn];
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    cin>>x>>n;
    for (int i=1; i<=n; i++) cin>>v[i]>>w[i]>>k[i];
    for (int i=1; i<=n; i++)
    {
        for (int j=0; j<=x; j++) dp[j].ss=0;
        for (int j=w[i]; j<=x; j++)
            if (dp[j-w[i]].ss<k[i])
                dp[j]=max(dp[j],{dp[j-w[i]].ff + v[i], dp[j-w[i]].ss+1});
    }
    int ans=0;
    for (int i=0; i<=x; i++) ans=max(ans,dp[i].ff);
    cout<<ans;
}

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