제출 #1015540

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1015540		asli_bg	Knapsack (NOI18_knapsack)	C++11	73 / 100	252 ms	262144 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
 
#define all(x) x.begin(),x.end()
#define fi first
#define se second
 
#define pb push_back 
#define sp <<' '<<
 
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vll;
typedef vector<bool> vb;
 
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a) for(int i=(a);i>=0;i--)
#define contp(a) for(auto el:a) {cout<<el.fi<<'-'<<el.se<<' ';}cout<<endl
#define cont(a) for(auto el:a) {cout<<el<<' ';}cout<<endl

const int MAXN=1e5+5;
const int MAXS=2e3+3;

int dp[MAXS];
int say[MAXS][MAXN];

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,mxw;
    cin>>mxw>>n;
    vi v(n+1);
    vi w(n+1);
    FOR(i,n){
        cin>>v[i+1]>>w[i+1]>>say[0][i+1];
    }

    dp[0]=0;
    int ind;
    FORE(i,1,mxw+1){
        ind=0;
        dp[i]=dp[i-1];
        FORE(j,1,n+1) say[i][j]=say[i-1][j];
        FORE(j,1,n+1){
            if(i-w[j]>=0 and say[i-w[j]][j]>0 and dp[i-w[j]]+v[j]>dp[i]){ //kullan
                dp[i]=dp[i-w[j]]+v[j];
                ind=j;
            }
        }
        if(ind>0){
            FORE(j,1,n+1){
                if(i-w[ind]>=0) say[i][j]=say[i-w[ind]][j]; 
                //i.weightte j.elemandan kaç tane kaldi
            }
            say[i][ind]--;
        }
    }
    cout<<dp[mxw]<<endl;
}

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