제출 #965132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965132		Elliot_7002	Knapsack (NOI18_knapsack)	C++14	49 / 100	1087 ms	600 KiB

knapsack

#include <iostream>
#include <bits/stdc++.h> 
using namespace std;
typedef tuple<int,int,int> triad;
#define int long long
#define INF 1e9
int s,n,val,weight,occ,ans;
vector<int> dp;
bool update(int value, int w){
    bool useful = false;
    for(int i = dp.size()-w-1; i >= 0; i--){
        dp[i + w] = max(dp[i+w], dp[i] + value);
        if(dp[i+w] == dp[i] + value){
          useful = true;
        }
    }
    return useful;
}
int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> s >> n;
    dp.resize(s+1);
    //int mod = 1e9+7;
    dp[0] = 0;
    if(n==1){
      cin >> val >> weight >> occ;
      if(s/weight > occ){
        ans = occ*val;
        cout << ans;
      }
      else{
        ans = val*(s/weight);
        cout << ans;
      }
    }
    else{
        for(int i = 0; i < n; i++){
            cin >> val >> weight >> occ;
            bool help = true;
            while(occ-- && help){
                help = update(val,weight);
            }
        }
        ans = dp[s];
        cout << ans;
        return 0;
    }
    
}

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