Submission #1305140

#TimeUsernameProblemLanguageResultExecution timeMemory
1305140vaishakhvKnapsack (NOI18_knapsack)C++20
37 / 100
1097 ms66144 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(0); cin.tie(0); ll s, n; cin >> s >> n; vector<pair<ll,ll>> items; ll count = 0; for (ll i{}; i < n; i++){ ll v, w, k; cin >> v >> w >> k; for (ll j{}; j < k; j++){ items.push_back({v,w}); } count += k; } vector<ll> dp(s+1, 0); for (auto item: items){ ll v = item.first, w = item.second; for (ll cap = s; cap >= w; cap--){ dp[cap] = max(dp[cap-w]+v, dp[cap]); } } cout << dp[s]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...