| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1109842 | vjudge1 | Knapsack (NOI18_knapsack) | C++17 | 86 ms | 3656 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 <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int, int> PI;
int main() {
int N, S;
cin >> S >> N;
vector<vector<pair<int, int>>> items;
items.resize(S + 1);
for (int i = 0, v, w, k; i < N; ++i) {
cin >> v >> w >> k;
items[w].push_back({v, k});
}
for (int i = 1; i <= S; ++i) {
sort(items[i].begin(), items[i].end(), [](const PI& a, const PI& b) {
return a.first > b.first;
});
}
long long dp[2][3001];
memset(dp, 0, sizeof(dp));
for (int s = 1; s <= S; ++s) {
// easy access for items
vector<int> vals;
for (int i = 0; i < items[s].size(); ++i) {
for (int j = 0; vals.size() * s <= S && j < items[s][i].second; ++j) {
vals.push_back(items[s][i].first);
}
}
long long (&a)[3001] = dp[s&1];
long long (&b)[3001] = dp[(s-1)&1];
for (int i = 0; i <= S; ++i) {
a[i] = b[i];
long long tv = 0;
for (int j = 0, tw = s; tw <= i && j < vals.size(); ++j, tw+=s) {
tv += vals[j];
long long tmp = b[i - tw] + tv;
a[i] = max(tmp, a[i]);
}
}
}
long long ans = 0;
for (int i = 0; i <= S; ++i) {
ans = max(ans, dp[S&1][i]);
}
cout << ans << endl;
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... | ||||
