제출 #796233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796233		aman1311	Knapsack (NOI18_knapsack)	C++17	0 / 100	886 ms	1876 KiB

knapsack

 #include<bits/stdc++.h>
using namespace std;
 
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long int
/*--------------------------------------------------------------------------------------------------------------------------*/
int solvee(int i,int cap,int n,vector<vector<int>> &dp,vector<vector<int>> &v){
    if(i>=n)return 0;
    if(dp[i][cap]!=-1)return dp[i][cap];
    
    int nottake=solvee(i+1,cap,n,dp,v);
    int take=0;
    for(int k=1;k<=cap;k++){
        if(k*v[i][1]<=cap)take=k*v[i][0]+solvee(i+1,cap-k*v[i][1],n,dp,v);
    }
    return dp[i][cap]=max(take,nottake);
}


void solve() {
   int s,n;
   cin >> s >> n;
   vector<vector<int>> v(n);
   for(int i=0;i<n;i++){
    int x,y,z;
    cin >> x >> y >> z;
    v[i]={x,y,z};
   }
   vector<vector<int>> dp(n,vector<int> (s+1,-1));
   cout<<solvee(0,s,n,dp,v)<<endl;
   
}
 
int32_t main() {
    fastio();
    int t=1;
    //cin >>t;
    while(t--){
         solve();
    }
   
}

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