Submission #875022

#TimeUsernameProblemLanguageResultExecution timeMemory
875022saturinaKnapsack (NOI18_knapsack)C++14
29 / 100
2 ms348 KiB
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define ar array
const int mxn = 1e6 + 5;
int s,dp[2005],n,cnt;
vector<ar<int,3>> vt(1);
int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> s >> n;
    for(int i = 1;i <= n;i++) {
        int v,w,k;
        cin >> v >> w >> k;
        if(w > s) continue;
        cnt++;
        ar<int,3> arr;
        arr[0] = v,arr[1] = w,arr[2] = k;
        vt.push_back(arr);
    }
    n = cnt;
    for(int i = 1;i <= n;i++) {
        int v = vt[i][0] , w = vt[i][1] , k = vt[i][2];
        for(int j = s;j >= 0;j--) {
            for(int t = 1;t * w <= j && t <= k;t++) {
                if(dp[j - t * w] + t * v >= dp[j]) dp[j] = max(dp[j] , dp[j - t * w] + t * v);
                else break;
            }
        }
    }
    cout << dp[s] << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...