Submission #693384

#TimeUsernameProblemLanguageResultExecution timeMemory
693384vjudge1Knapsack (NOI18_knapsack)C++17
49 / 100
238 ms262144 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int W, n; cin >> W >> n; vector<array<long long, 2>> a; // { (value, weight) } vector<vector<array<int, 2>>> mp(W + 1); for (int i = 0; i < n; i++) { int v, w, cnt; cin >> v >> w >> cnt; mp[w].push_back({v, cnt}); } for (int w = 1; w <= W; w++) { sort(mp[w].begin(), mp[w].end(), greater<>()); int needed = W / w; int i = 0; for (auto [v, cnt] : mp[w]) { for (int i = 0; i < min(needed, cnt); i++) { a.push_back({v, w}); } needed -= cnt; } } n = a.size(); vector<long long> dp(W + 1, 0); for (int i = 1; i <= n; i++) { for (int w = W; w >= a[i - 1][1]; w--) { dp[w] = max( dp[w], dp[w - a[i - 1][1]] + a[i - 1][0] ); } } cout << *max_element(dp.begin(), dp.end()) << "\n"; }

Compilation message (stderr)

knapsack.cpp: In function 'int main()':
knapsack.cpp:22:13: warning: unused variable 'i' [-Wunused-variable]
   22 |         int i = 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...