# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
955971 | Nelt | Knapsack (NOI18_knapsack) | C++17 | 1051 ms | 600 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 ll long long
#define endl "\n"
using namespace std;
void solve()
{
ll s, n;
cin >> s >> n;
vector<ll> items[s + 1];
while (n--)
{
ll v, w, k;
cin >> v >> w >> k;
k = min(k, s / w);
while (k--)
items[w].push_back(v);
sort(items[w].begin(), items[w].end(), greater());
while (items[w].size() * w > s)
items[w].pop_back();
}
ll dp[s + 1];
for (ll i = 0; i <= s; i++)
dp[i] = 0;
for (ll i = 1; i <= s; i++)
for (ll j : items[i])
for (ll k = s - i; k >= 0; k--)
dp[k + i] = max(dp[k + i], dp[k] + j);
cout << *max_element(dp, dp + s + 1) << endl;
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll t = 1;
// precomp();
// cin >> t;
for (ll i = 1; i <= t; i++)
solve();
cerr << "\nTime elapsed: " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}
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... |