# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088641 | damamila | Knapsack (NOI18_knapsack) | C++14 | 43 ms | 1700 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;
//~ #define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int s, n;
cin >> s >> n;
vector<vector<pair<int, int>>> items(s+1);
for (int i = 0; i < n; i++) {
int v, w, k;
cin >> v >> w >> k;
items[w].push_back({v, k});
}
vector<int> dp(s+1, 0);
for (int i = 1; i <= s; i++) {
sort(items[i].rbegin(), items[i].rend());
//~ cout << i << ": " << endl;
int cnt = 0;
int sz = s/i;
for (int j = 0; j < items[i].size(); j++) {
auto [v, anz] = items[i][j];
while (cnt < sz && anz) {
for (int k = s; k >= i; k--) {
dp[k] = max(dp[k], dp[k-i]+v);
//~ cout << "HERE: " << k << " " << dp[k] << endl;
}
cnt++;
anz--;
}
}
}
cout << dp[s] << 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... |