| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 849065 | AbdalrhmanMohammad | Knapsack (NOI18_knapsack) | C++14 | 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.
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define ll long long
#define yn(tf) cout << (tf ? "YES\n" : "NO\n")
#define Endl endl
#define ld long double
const ld PI = 3.14159265359;
const ll MOD = 998244353;
const ll N = 1e5 + 7;
int s, n;
int v[N], w[N], k[N];
vector<vector<int>> mem;
int fun(int i, int rem) {
if (rem < 0)
return -1e15;
if (i == n || rem == 0)
return 0;
ll &res = mem[i][rem];
if (res != -1)
return res;
res = fun(i + 1, rem);
for (ll j = 1; j <= min(2000, k[i]); j++)
res = max(res, fun(i + 1, rem - j * w[i]) + v[i] * j);
return res;
}
int main() {
FAST
cin >> s >> n;
mem = vector<vector<ll>>(n + 1, vector<ll>(s + 1));
for (int i = 0; i < n; i++)
cin >> v[i] >> w[i] >> k[i];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= s; j++)
mem[i][j] = -1;
cout << fun(0, s);
return 0;
}
/*
*/
// BEFORE coding are you sure you understood the statement correctly?
// PLEASE do not forget to read the sample explanation carefully.
// WATCH out for overflows & RTs in general.
// TEST your idea or code on the corner cases.
// ANALYZE each idea you have thoroughly.