제출 #500603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500603		dnaux	Knapsack (NOI18_knapsack)	C++17	73 / 100	1044 ms	3916 KiB

knapsack

#include <bits/stdc++.h>
#define endline "\n"
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define lsb(i) i&(-i)
#define sz(i) (int)i.size()
 
typedef long long ll;
using namespace std;
const ll INF = 1e18L;
constexpr int mod = int(1e9) + 7;
 
ll t=1, n, m, k, q, s, cases = 0;

void solve(){
    cin >> s >> n;
    vector<ll> val(n),weight(n),amount(n);
    for(int i = 0; i < n; i++){
        cin >> val[i] >> weight[i] >> amount[i];
    }
    vector<ll> dp(s+10,0);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < min(amount[i],(s / weight[i]) + 1); j++){
            for(int k = s; k >= weight[i]; k--){
                dp[k] = max(dp[k], dp[k - weight[i]] + val[i]);
            } 
        }
    }
    ll ans = 0;
    for(int i = 0; i <= s; i++)ans = max(ans,dp[i]);
    cout << ans;
}

int main(){
    #ifdef ONLINE_JUDGE
        freopen("feast.in","r",stdin);
        freopen("feast.out","w",stdout);
    #endif
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    //cin>>t;
    for(; cases < t; cases++)solve();
    return 0;
}

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