| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 965308 | Unforgettablepl | Knapsack (NOI18_knapsack) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define f first
#define s second
//#define x first
//#define y second
const int INF = INT32_MAX;
const ll modulo = 1e4;
//#define int ll
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("input.in","r",stdin);
// freopen("haybales.out","w",stdout);
int W,n;
cin >> W >> n;
if(n==1){
int v,w,k;
cin >> v >> w >> k;
assert(n==1);
cout << v*min(k,W/w);
return 0;
}
vector<tuple<ll,ll,ll>> items(n);
for (int i = 0; i < n; i++) {
int a,b,c;
cin >> a >> b >> c;
c=min(s/b,c);
items.emplace_back(a,b,c);
}
vector<ll> DP(W+1);
for(auto[val,wt,k]:items){
for(int x=1;x<=k;x++){
for (int i = W; i >= x*wt; i--) {
DP[i] = max(DP[i],DP[i-wt]+val);
}
}
}
cout << DP[W];
}