제출 #660574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
660574		Ronin13	Knapsack (NOI18_knapsack)	C++14	73 / 100	1083 ms	3896 KiB

knapsack

#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
#define ull unsigned ll
using namespace std;
const int nmax = 3e5 + 1;


int main(){
    #ifndef ONLINE_JUDGE
   // freopen("in.txt", "r", stdin);
   // freopen("out.txt", "w", stdout);
    #endif // ONLINE_JUDGE
    int s, n; cin >> s >> n;
    ll k[n + 1], v[n + 1], w[n + 1];
    for(int i = 1; i <= n; i++){
        cin >> v[i] >> w[i] >> k[i];
    }
    ll dp[s + 1];
    fill(dp, dp + s + 1, 0);
    dp[0] = 0;
    for(int i = 1; i <= n; i++){
        for(int j = s; j >= 0; j--){
            ll cnt = -1;
            for(int l = j; l >= 0; l -= w[i]){
                cnt++;
                if(cnt > k[i]) break;
                dp[j] = max(dp[j], dp[l] + cnt * v[i]);
            }
        }
    }
    ll mx = 0;
    for(int i = 1; i <= s; i++)
        mx = max(mx, dp[i]);
    cout << mx;
}

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