제출 #965809

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
965809		vjudge1	Knapsack (NOI18_knapsack)	C++17	100 / 100	57 ms	1776 KiB

knapsack

#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define stp(n) fixed<<setprecision(n)
#define flash cin.tie(0); cin.sync_with_stdio(0);
#define el '\n'
#define Point pair<double, double>   // Define Point as a pair of doubles

using namespace std;

////
#pragma GCC optimize("03")
#pragma GCC target("tune=native")
#pragma GCC optimize("unroll-loops")


const int inf = 1e9, N = 2e3 + 9, mod = 998244353, M = 6e3;
ll dp[2][N];
vector<vector<pair<int, int>>> W(N);

void testCase() {
    int n, s;
    cin >> s >> n;
    for (int i = 0; i < n; ++i) {
        int vi, wi, ki;
        cin >> vi >> wi >> ki;
        W[wi].push_back({vi, ki});
    }
    for (int i = 1; i <= s; i++)sort(W[i].rbegin(), W[i].rend());
    int p = 0;
    memset(dp, 0, sizeof dp);
    for (int w = s; w >= 1; w--) {
        p = !p;
        for (int rem = 0; rem <= s; rem++) {
            ll &ans = dp[p][rem];
            ans = dp[!p][rem];
            ll sum = 0, cnt = 0, l = 0;
            for (int i = 1; i <= (rem / w); i++) {
                if (l == W[w].size())break;
                cnt++, sum += W[w][l].first;
                ans = max(ans, dp[!p][rem - i * w] + sum);
                if (cnt == W[w][l].second)l++, cnt = 0;
            }
        }
    }
    cout << dp[p][s];

}

int main() {

//    freopen("feast.in", "r", stdin);
//    freopen("feast.out", "w", stdout);

    flash;
    int t = 1;
    //cin >> t;
    while (t--) {
        testCase();
    }

}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'void testCase()':
knapsack.cpp:40:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 if (l == W[w].size())break;
      |                     ~~^~~~~~~~~~~~~~

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