제출 #492450

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492450		rocww	Knapsack (NOI18_knapsack)	C++14	73 / 100	1087 ms	332 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long 
#define lli long long
#define mod 1000000007
#define mod2 998244353
#define si size()
#define dou double
 
void fast(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}
 
/*void init_code(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif 
}*/

 
int main(){
  fast();
  //init_code();
 
  int s,n;
  cin>>s>>n;
  long long cnt[s+5]={0};
  long long lol[s+5]={0};
  int memo[s+5]={0};
  memo[0]=1;
  for(int i=1;i<=n;i++){
    long long int v,w,k;
    cin>>v>>w>>k;
    if(k*w<=s){
    k=min(s/w+1,k);
    while(k--){
      for(int i=s;i>=0;i--){
        if(memo[i]){
          if(i+w<=s){
            memo[i+w]=1;
            cnt[i+w]=max(cnt[i]+v,cnt[i+w]);
          }
        }
      }
    }
    }else{
        lol[w]=max(lol[w],v);
    }
  }
  for(int i=1;i<=s;i++){
      for(int j=0;j<=s-i;j++){
          cnt[j+i]=max(lol[i]+cnt[j],cnt[j+i]);
      }
  }
  long long ans=0;
  for(int i=0;i<=s;i++){
    ans=max(cnt[i],ans);
  }
  cout<<ans<<"\n";




 
}

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