제출 #676003

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676003		gaurav154	Knapsack (NOI18_knapsack)	C++14	0 / 100	122 ms	262144 KiB

knapsack

#include<bits/stdc++.h>
using namespace std ;
int f(int i , int target , vector<int> &valnew, vector<int> &wtnew,vector<vector<int>> &dp){

    if(i==0){
        if(wtnew[i]<= target){
            
                return valnew[i]*(target/wtnew[i]);
        }else{
            return 0 ;
        }
    }if(dp[i][target] != -1) return dp[i][target] ;
    int nottake = f(i-1,target,valnew,wtnew,dp);
    
    int take = INT_MIN;
    if(wtnew[i] <= target){
        take = f(i-1,target - wtnew[i],valnew,wtnew,dp) + valnew[i];
    }
    return dp[i][target] = max(take,nottake);
}
int main(){
    int s,n;cin>>s>>n;
    vector<int> val,wt,copy ;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j< 3;j++)
        {
            int x ;
            cin>>x ;
            if(j==0){
                val.push_back(x);
            }if(j==1){
                wt.push_back(x);
            }if(j==2){
                copy.push_back(x);
            }
        }
        
    }
    vector<int> valnew,wtnew ;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < copy[i]; j++)
        {
            valnew.push_back(val[i]);
            wtnew.push_back(wt[i]);
        }
        
    }vector<vector<int>> dp(valnew.size(),vector<int>(s+1,-1));
    
        
    cout<< f(valnew.size()-1,s,valnew,wtnew,dp);
    
}

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