Submission #832033

#	Time	Username	Problem	Language	Result	Execution time	Memory
832033		trMatherz	Knapsack (NOI18_knapsack)	C++17	100 / 100	116 ms	35192 KiB

knapsack

     #include <iostream>

/*
#include <fstream>
std::ifstream cin ("time.in");
std::ofstream cout ("time.out");
*/

using namespace std;

#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <algorithm>
#include <queue>
#include <string>
#include <cstring>
#include <cstdio>
#include <iomanip>
#include <list>
#include <numeric>
#include <cmath>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()



#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define vvl vector<vl>
#define vpi vector<pair<int,int>>
#define vb vector<bool>
#define pb push_back
#define mp make_pair
#define pi pair<int, int>

#define FR(x, a, b) for(int x = a; x < b; x++)
#define F(x, b) FR(x, 0, b)


#define f first
#define s second
#define ll long long

using namespace std;



int main() {
    int limit;
    int type_num;
    std::cin >> limit >> type_num;

    std::map<int, vector<pair<int, int>>> by_weight;
    for (int t = 0; t < type_num; t++) {
        int value;
        int weight;
        int amt;
        std::cin >> value >> weight >> amt;
        if (weight <= limit && amt > 0) {
            by_weight[weight].push_back({value, amt});
        }
    }

    /*
     * best[i][j] contains the most value we can
     * get using j weight and the first i weight types
     */
    vector<vector<long long>> best(by_weight.size() + 1,
                                   vector<long long>(limit + 1, INT32_MIN));
    best[0][0] = 0;
    int at = 1;
    for (auto &[w, items] : by_weight) {
        // sort items in reverse order by value
        std::sort(items.begin(), items.end(), std::greater<pair<int, int>>());
        for (int i = 0; i <= limit; i++) {
            best[at][i] = best[at - 1][i];
            int copies = 0;
            int type_at = 0;
            int curr_used = 0;
            long long profit = 0;
            // go through as many items until we run out of items or usable
            // weight
            while ((copies + 1) * w <= i && type_at < items.size()) {
                copies++;
                profit += items[type_at].first;
                if (best[at - 1][i - copies * w] != INT32_MIN) {
                    best[at][i] = std::max(
                        best[at][i], best[at - 1][i - copies * w] + profit);
                }

                curr_used++;
                if (curr_used == items[type_at].second) {
                    curr_used = 0;
                    type_at++;
                }
            }
        }
        at++;
    }
    cout << *std::max_element(best.back().begin(), best.back().end()) << endl;
}

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:90:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             while ((copies + 1) * w <= i && type_at < items.size()) {
      |                                             ~~~~~~~~^~~~~~~~~~~~~~

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