Submission #1268386

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268386		michael12	Knapsack (NOI18_knapsack)	C++20	0 / 100	28 ms	33156 KiB

knapsack

#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;




int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int n,m;
    cin >> n >> m;
    vector<pair<int, int>> pq;
    int dp[n];
    for(int i = 0; i < n; i++){
        dp[i] = 0;
    }
    for(int i = 0; i < m; i++){
        int a,b,c;
        cin >> a >> b >> c;
        pq.push_back({a, b});
        while(c > 1){
        pq.push_back({a, b});
        c--;
        }
        int u = pq.size();
        for(int k = n; k >= b; k--){
            dp[k] = max(dp[k], dp[k - b] + a);
        }
        // for(int k = n; k >= a; k--){
        //     dp[k] = max(dp[k], dp[k - a] + b);
        // }
    }
    int y = pq.size();
    
    int ans = 0;
    for(int i = 0; i < n; i++){
        ans = max(ans, dp[i]);
    }
    cout << ans;


   
}

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