# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
482680 | Olympia | Knapsack (NOI18_knapsack) | C++17 | 1073 ms | 4436 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 <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
using namespace std;
#define ll long long
struct item {
long long weight;
long long worth;
long long cnt;
};
int main() {
long long S, N;
cin >> S >> N;
vector<item> items;
for (int i = 0; i < N; i++) {
long long wei, wor;
cin >> wor >> wei;
long long cnt;
cin >> cnt;
items.push_back({wei, wor, min(cnt, S/wei)});
}
long long dp[S + 1];
for (int j = 0; j <= S; j++) {
dp[j] = 0;
}
long long myMax = 0;
for (int i = 1; i <= items.size(); i++) {
for (int j = S; j >= 0; j--) {
int cntr = 0;
while (cntr * items[i - 1].weight <= j && cntr <= items[i - 1].cnt) {
dp[j] = max(dp[j], dp[j - cntr * items[i - 1].weight] + cntr * items[i - 1].worth);
cntr++;
}
myMax = max(myMax, dp[j]);
}
}
cout << myMax << endl;
}
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... |