제출 #985748

#제출 시각아이디문제언어결과실행 시간메모리
985748vjudge1Knapsack (NOI18_knapsack)C++17
12 / 100
1 ms456 KiB
#include <bits/stdc++.h>
using i64 = long long;

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

    int S, N;
    std::cin >> S >> N;

    std::map<int, std::vector<std::pair<int, int>>> item;
    for (int i = 0; i < N; i++) {
        int v, w, k;
        std::cin >> v >> w >> k;
        
        item[w].push_back({v, k});
    }

    std::vector<int> dp(1 + S);

    for (auto &[w, vec] : item) {
        for (int j = S; j >= 0; j--) {
            int val = 0;
            for (int c = 1, i1 = 0, i2 = 0; c * w <= S; c++) {
                if (i2 == vec[0].second) {
                    i1++, i2 = 0;
                }
                if (i1 == (int)vec.size()) {
                    break;
                }

                auto [v, k] = vec[i1];
                val += v, i2++;

                if (j + c * w <= S) {
                    dp[j + c * w] = std::max(dp[j + c * w], dp[j] + val);
                }
            }
        }
    }

    std::cout << dp[S] << "\n";

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...