Submission #630577

#	Time	Username	Problem	Language	Result	Execution time	Memory
630577		chjiao	Knapsack (NOI18_knapsack)	C++14	37 / 100	3 ms	468 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    // freopen("Knapsack.in", "r", stdin);
    // freopen("Knapsack.out", "w", stdout);

	int limit, type_num;
	cin >> limit >> type_num;
	
	// map<int, vector<tuple<int, int, int>>> by_weight;  //{weight, {value, amount}}, 根据weight从小到大排序

    vector<vector<int>> items(type_num, vector<int>(3));
	for (int i = 0; i < type_num; i++) {
        int weight, num, val;
        cin >> val >> weight >> num;
        if (weight>limit) continue;
        items[i][0] = weight;  items[i][1] = num;  items[i][2] = val; 
        
	}
	
    vector<ll> dp(limit+1, -1);
    dp[0]= 0;

    int dylimit=0;

    for (int t=0; t<type_num; t++) {
        int weight, num, val;
        weight = items[t][0]; num = items[t][1]; val = items[t][2];
            for (int i= min(limit - weight, dylimit); i>=0; i--) {
                for (int k=1; k <= num; k++) {
                    if (dp[i]>=0 && i+k*weight <=limit) {
                        dp[i+k*weight] = max(dp[i+k*weight], dp[i] + k*val);
                        dylimit = max(dylimit,  i+k*weight );
                    }
                }

            }
    }

    cout << *max_element(dp.begin(), dp.end()) << endl;
}

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