Submission #1103385

#TimeUsernameProblemLanguageResultExecution timeMemory
1103385Mauricio_CruzKnapsack (NOI18_knapsack)C++17
73 / 100
1063 ms3408 KiB
#include <bits/stdc++.h>
using namespace std;
#define srtl(x)sort((x).begin(),(x).end())
#define srtg(x)sort((x).begin(),(x).end(),greater<>())
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define f first
#define s second
#define pb push_back
#define pii pair<int,int>
#define ins insert
#define vi vector<int>
#define vii vector<pii>
#define viii vector<pair<int,pii>>

int ax[4]={0,1,0,-1};
int ay[4]={1,0,-1,0};
#define int long long

int32_t main(){
    ios;
    int k,n;
    cin>>k>>n;
    int a[n][3];
    for(int i=0;i<n;i++){
    	for(int j=0;j<3;j++)cin>>a[i][j];
	}
    vector<int>dp(k+1,0);
    for(int i=0;i<n;i++){
    	for(int j=k;j>=0;j--){
    		int mul=1;
    		int a2=a[i][2];
    		for(int l=j-a[i][1];l>=0&&a2!=0;l-=a[i][1],a2--){
    			dp[j]=max(dp[j],dp[l]+(a[i][0])*mul);
    			mul++;
			}
		}
	}
	cout<<dp[k];
    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...