# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
798870 | hoangreal | Knapsack (NOI18_knapsack) | C++17 | 269 ms | 262144 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.
// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = a; i <= b; ++i)
#define FOR_NEG(i, a, b) for(ll i = a; i >= b; --i)
#define FOR_EACH(a, b) for(auto a : b)
ll solve_optimal(ll x, ll n, vector<ll>& weights, vector<ll>& values){
vector<ll> dp(x+1, 0);
FOR(i, 1, n) {
FOR_NEG(j, x, 1) {
ll if_notUse_ans = 0 + dp[j];
ll if_use_ans = 0;
if(j - weights[i-1] >= 0) { if_use_ans = values[i-1] + dp[j - weights[i-1]]; }
dp[j] = max(if_use_ans, if_notUse_ans);
}
}
return dp[x];
}
int main() {
// Inputs
ll s, n;
cin >> s >> n;
vector<array<ll, 2>> vk[s + 1];
# | 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... |