Submission #719309

#TimeUsernameProblemLanguageResultExecution timeMemory
719309JANCARAPANKnapsack (NOI18_knapsack)C++17
12 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; // #define int long long #define ll long long #define fi first #define se second #define pb push_back #define all(a) (a).begin(), (a).end() #define sz(a) (long long) a.size() #define endl '\n' #define dbg(a) cerr << #a << " = " << a << endl; #define print(a) for (auto x : a) cerr << x << " "; cerr << endl; const long long INF = 1e18, MOD = 1e9 + 7; void solve(){ int s, n; cin >> s >> n; vector<int> v(n), w(n), k(n); for (int i = 0; i < n; i++) { cin >> v[i] >> w[i] >> k[i]; } vector<int> dp(s + 1); for (int i = 0; i < n; i++) { vector<int> already(s + 1); for (int j = w[i]; j <= s; j++) { if (dp[j - w[i]] + v[i] > dp[j] && already[j - w[i]] + 1 <= k[i]) { dp[j] = dp[j - w[i]] + v[i]; already[j] = already[j - w[i]] + 1; } if (dp[j] < dp[j - 1]) { dp[j] = dp[j - 1]; already[j] = already[j - 1]; } } } cout << *max_element(all(dp)) << endl; } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int tt = 1; //cin >> tt; while (tt--) { solve(); } 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...