제출 #772269

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
772269		RandomChicken	Knapsack (NOI18_knapsack)	C++11	73 / 100	1078 ms	3916 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define f0r(i,n) for(ll i = 0; i<(ll)(n); i++)

int main(){
  ll capacity,n;
  cin>>capacity>>n;
  ll value[n], weight[n], quantity[n];
  f0r(i,n) cin>>value[i]>>weight[i]>>quantity[i];

  ll dp[capacity+1]; // in theory: dp[n+1][capacity+1]; but made 1D for memory saving
  ll nextDp[capacity+1]; // AUXILIARY FOR TEMPORARILY HOLDING EDITS TO DP
  f0r(j,capacity+1) dp[j] = 0; // initial row with nothing considered
  f0r(i,n){
    // considering item i
    f0r(j,capacity+1){
      nextDp[j] = dp[j];
      ll buyCount = 0;
      while(j+buyCount*weight[i]<=capacity&&buyCount<=quantity[i]){
        nextDp[j] = max(nextDp[j],dp[j+buyCount*weight[i]]+buyCount*value[i]);
        buyCount++;
      }
    }
    f0r(j,capacity+1){
      dp[j] = nextDp[j];
      // cout<<setw(5)<<dp[j];
    }
    // cout<<"\n";
  }
  cout<<dp[0];
}

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