제출 #771088

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
771088		8pete8	Knapsack (NOI18_knapsack)	C++14	29 / 100	2 ms	1876 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<pii,int>
#define pll pair<ll,ll>
#define ppll pair<ll,pair<ll,ll>>
#define pbb pair<bool,bool>
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
const int mxn=1e5+1;
pii dp[mxn+10][2002];
int32_t main(){
    fastio
    int s,n;cin>>s>>n;
    vector<pair<pii,ll>>v(n+1);
    for(int i=1;i<=n;i++)cin>>v[i].f.f>>v[i].f.s>>v[i].s,v[i].s--;
    //val, weight, how many
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=s;j++){
            dp[i][j].s=v[i].s;
            dp[i][j].f=dp[i-1][j].f;
            if(j-v[i].f.s>=0){
                dp[i][j].f=max(dp[i][j].f,dp[i-1][j-v[i].f.s].f+v[i].f.f);
                if(dp[i][j].f<dp[i][j-v[i].f.s].f+v[i].f.f&&dp[i][j-v[i].f.s].s>0){
                    dp[i][j].f=dp[i][j-v[i].f.s].f+v[i].f.f;
                    dp[i][j].s=dp[i][j-v[i].f.s].s-1;
                }
            }
            ans=max(ans,dp[i][j].f);
        }
    }
    cout<<ans<<'\n';
}

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