Submission #964529

#TimeUsernameProblemLanguageResultExecution timeMemory
964529stdfloatKnapsack (NOI18_knapsack)C++17
73 / 100
281 ms262144 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int S, n; cin >> S >> n; vector<int> V, W; for (int i = 0; i < n; i++) { int v, w, k; cin >> v >> w >> k; k = min(k, S / w); while (k--) { V.push_back(v); W.push_back(w); } } vector<int> dp(S + 1, -1); dp[0] = 0; for (int i = 0; i < (int)V.size(); i++) { for (int j = S; j >= W[i]; j--) if (dp[j - W[i]] != -1) dp[j] = max(dp[j], dp[j - W[i]] + V[i]); } cout << *max_element(dp.begin(), dp.end()); }
#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...