Submission #1105936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105936		DON_F	Knapsack (NOI18_knapsack)	C++14	73 / 100	1054 ms	2896 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) x.begin(), x.end()
#define L(i, b, e) for (int i = b; i < e; ++i)
#define R(i, b, e) for (int i = b; i >= e; --i)
#define pb emplace_back
#define vi vector<int>
#define sz(x) ((int) x.size())
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int s, n;
    cin >> s >> n;
    vi v(n), w(n), k(n);
    L(i, 0, n){
        cin >> v[i] >> w[i] >> k[i];
    }
    vector<i64> dp(s + 1, -1);
    dp[0] = 0;
    L(i, 0, n){
        L(j, 0, w[i]){
            deque<pair<i64, int>> dq;
            int c = 0;
            for (int p = j; p <= s; p += w[i]){
                while (!dq.empty() && c - dq.front().second > k[i])dq.pop_front();
                i64 t = dp[p];
                if (!dq.empty()){
                    dp[p] = max(dp[p], dq.front().first + 1LL * dq.front().second * v[i] + 1LL * (c - dq.front().second) * v[i]);
                }
                if (t != -1){
                    i64 m = t - 1LL * c * v[i];
                    while (!dq.empty() && dq.back().first <= m)dq.pop_back();
                    dq.push_back({m, c});
                }
                c++;
            }
        }
    }
    cout << *max_element(all(dp));
}

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