Submission #1014223

#TimeUsernameProblemLanguageResultExecution timeMemory
1014223aufanKnapsack (NOI18_knapsack)C++17
49 / 100
1029 ms600 KiB
#include <bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int s, n; cin >> s >> n; vector<int> dp(s + 1); for (int i = 0; i < n; i++) { int v, w, k; cin >> v >> w >> k; vector<int> ndp = dp; for (int j = 1; j <= k; j++) { for (int l = j * w; l <= s; l++) { ndp[l] = max(ndp[l], dp[l - j * w] + j * v); } } swap(dp, ndp); } int ans = 0; for (int i = 0; i <= s; i++) ans = max(ans, dp[i]); cout << ans << '\n'; return 0; }
#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...