제출 #1275989

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1275989		lee.desmond2016	Knapsack (NOI18_knapsack)	C++20	73 / 100	1096 ms	588 KiB

knapsack

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = -1e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int S, N;
    cin >> S >> N;
    vector<ll> dp(S + 1, 0);

    for (int i = 0; i < N; i++) {
        int v, w, k;
        cin >> v >> w >> k;

        for (int r = 0; r < w; r++) {
            deque<pair<ll,ll>> dq; // {dp value, index}
            for (int j = 0; j * w + r <= S; j++) {
                ll idx = j * w + r;
                ll val = dp[idx] - j * v;

                while (!dq.empty() && dq.back().first <= val) dq.pop_back();
                dq.push_back({val, j});

                while (!dq.empty() && j - dq.front().second > k) dq.pop_front();

                dp[idx] = dq.front().first + j * v;
            }
        }
    }

    cout << dp[S] << "\n";
}

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