Submission #932206

#TimeUsernameProblemLanguageResultExecution timeMemory
932206RegulusKnapsack (NOI18_knapsack)C++17
73 / 100
1091 ms1584 KiB
#include <bits/stdc++.h> #define IO ios::sync_with_stdio(false);cin.tie(0); #define debug(x) cerr << #x << " = " << (x) << ' ' #define bug(x) cerr << (x) << ' ' #define endl cerr << '\n' #define all(v) (v).begin(), (v).end() #define SZ(v) (ll)(v).size() #define lowbit(x) (x)&-(x) #define pb emplace_back #define F first #define S second using namespace std; using ll = long long; using pll = pair<ll, ll>; //#define TEST const int N = 1e5+5; ll wei, val, num, dp[2005]; int main(void) { IO int n, i, T; cin >> T >> n; for (i=1; i <= n; ++i) { cin >> val >> wei >> num; for (int j=1; num > 0; j <<= 1) { int tmp = min((ll)j, num); num -= tmp; for (int k=T; k >= tmp*wei; --k) dp[k] = max(dp[k], dp[k-wei*tmp] + val*tmp); } } cout << dp[T] << '\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...