Submission #1346187

#TimeUsernameProblemLanguageResultExecution timeMemory
1346187MunkhErdeneKnapsack (NOI18_knapsack)C++17
37 / 100
1095 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define _ << " " <<
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define ull unsigned long long
#define lll __int128
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define BlueCrowner ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
const ll mod = 1e9 + 7;
void solve() {
	ll s, n; cin >> s >> n;
	vector<ll> dp(s + 1, 0); 
	FOR(i, 0, n) {
		ll v, w, k; cin >> v >> w >> k;
		FORD(j, s, 0) {
			FOR(freq, 1, k + 1) {
				if(j + freq * w <= s) 
					dp[j + freq * w] = max(dp[j + freq * w], dp[j] + freq * v);
			}
		}
	}
	cout << *max_element(all(dp)) << '\n';
}
int main() {
	BlueCrowner;
	ll t = 1;
	//cin >> t;
	while (t--) {
		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...