Submission #520476

#	Time	Username	Problem	Language	Result	Execution time	Memory
520476		nguyentu	Knapsack (NOI18_knapsack)	C++14	100 / 100	80 ms	5148 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define ii pair<int , int>
#define v first
#define k second
#define inf (int) (1e9 + 7)

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);cout.tie(NULL);
    int n , m; cin >> m >> n;
    vector<ii> a[m + 1];
    for (int i = 1 ; i <= n ; i++) {
        int v , w , k; cin >> v >> w >> k;
        a[w].push_back(ii(v , k));
    }
    vector<int> dp;
    dp.assign(m + 1 , -1);
    dp[0] = 0;
    for (int i = 1 ; i <= m ;i ++) {
        if (!a[i].size()) continue; 
        vector<int> f;
        f.assign(m + 1 , 0);
        sort(a[i].begin() , a[i].end() , greater<ii>());
        
        for (int j = i ; j <= m ; j++) {
            int cnt , used , pos , total;
            cnt = used = pos = total = 0;
            while ((cnt + 1)*i <= j && pos < a[i].size()) {
                cnt++;
                used++;
                total += a[i][pos].v;
                if (dp[j - cnt*i] != -1)
                    f[j] = max(f[j] , dp[j - cnt*i] + total);
                if (used == a[i][pos].k) {
                    pos++;
                    used = 0;
                }
            }
        }
        for (int j = i ; j <= m ; j++) {
            dp[j] = max(dp[j] , f[j]);
        }

    }
    int ans = 0;
    for (int i = 0 ; i <= m ; i++) {
         ans = max(ans , dp[i]);
         //cerr << dp[i] << " ";
    }
    cout << ans;
    return 0;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:31:44: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             while ((cnt + 1)*i <= j && pos < a[i].size()) {
      |                                        ~~~~^~~~~~~~~~~~~

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