Submission #540557

#	Time	Username	Problem	Language	Result	Execution time	Memory
540557		ac2hu	Knapsack (NOI18_knapsack)	C++14	0 / 100	1 ms	724 KiB

knapsack

#include <bits/stdc++.h>
#ifdef DEBUG
#include "../templates/debug.h"
#else 
#define deb(x...)
#endif
using namespace std;
#define int long long 
int dp[(int)1e5 + 100][(int)2e3 + 10];
signed main() {
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);cout.tie(nullptr);
        int s,n;cin >> s >> n;
        vector<array<int,3>> items(n);
        for(int i = 0;i<n;i++){
                for(int j = 0;j<3;j++)cin >> items[i][j];
        }

        for(int i =0;i<n;i++){
                for(int j = 0;j<=s;j++){
                        if(j != 0)
                                dp[i][j] = dp[i][j - 1];
                        if(j >= items[i][1])
                                dp[i][j] = max(dp[i][j], dp[i - 1][j - items[i][1]] + items[i][0]);
                }
        }
        cout << dp[n - 1][s] << "\n";
}

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