Submission #1304097

#TimeUsernameProblemLanguageResultExecution timeMemory
1304097Zone_zoneeKnapsack (NOI18_knapsack)C++20
37 / 100
1 ms584 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; const int N = 1e5+10, S = 2e4+10; ll dp[S]; vector<pair<int, int>> a; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int s, n; cin >> s >> n; for(int i = 1; i <= n; ++i){ int v, w, k; cin >> v >> w >> k; for(int j = 0; k > 0; ++j){ a.push_back({w*min(k, 1<<j), v*min(k, 1<<j)}); k -= (1<<j); } } for(auto [w, v] : a){ for(int i = s; i >= w; --i){ dp[i] = max(dp[i], dp[i-w] + v); } } cout << dp[s] << '\n'; }
#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...