# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020962 | urejgi | Knapsack (NOI18_knapsack) | C++17 | 1077 ms | 16096 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>
#define int long long
using namespace std;
signed main(){
int s, n;
scanf("%lld %lld", &s, &n);
vector<int> value, weight;
int v, w, k;
for (int i = 0; i < n; ++i) {
scanf("%lld %lld %lld", &v, &w, &k);
int count = 1;
while (k > 0) {
int currentCount = min(count, k);
value.push_back(currentCount * v);
weight.push_back(currentCount * w);
k -= currentCount;
count <<= 1;
}
}
int totalItems = value.size();
vector<int> dp(s + 1, 0);
for (int i = 0; i < totalItems; ++i) {
for (int j = s; j >= weight[i]; --j) {
dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
}
}
printf("%lld\n", dp[s]);
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... |