# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994015 | roadster | Knapsack (NOI18_knapsack) | C++17 | 1094 ms | 2908 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;
using vi = vector<int>;
using vvi = vector<vector<int> >;
using pi = pair<int, int>;
using ll = long long;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define f first
// #define s second
#define pb push_back
const ll MOD = 1e9 + 7;
ll expo(ll x, ll n) {
ll res = 1LL;
while (n) {
if (n % 2){ res = res * x % MOD; }
x = x * x % MOD;
n /= 2;
}
return res;
}
vector<ll> factorial(int n) {
vector<ll> fact(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) { fact[i] = fact[i - 1] * i % MOD; }
return fact;
}
vector<ll> mod_inverse(int n, ll fact_n) {
vector<ll> inv(n + 1);
inv[n] = expo(fact_n, MOD - 2);
for (int i = n; i >= 1; i--) {
inv[i - 1] = inv[i] * i % MOD;
}
return inv;
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// your code goes here
int s, n;
cin >> s >> n;
vi v(n+1), w(n+1), k(n+1);
for (int i = 1; i <= n; i++) cin >> v[i] >> w[i] >> k[i];
vector<vector<ll>> dp(2, vector<ll> (s+1));
for (int i = 1; i <= n; i++) {
int now = i % 2;
int last = 1 - now;
for (int j = 0; j <= s; j++) {
dp[now][j] = 0;
for (int l = 0; j - l * w[i] >= 0 && l <= k[i]; l++) {
dp[now][j] = max(dp[now][j], dp[last][j-l*w[i]] + 1LL * l * v[i]);
}
}
}
ll res = 0LL;
for (int i = 0; i <= s; i++) {
res = max(res, dp[n%2][i]);
}
cout << res << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |