| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 780357 | christinelynn | Knapsack (NOI18_knapsack) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define sec second
#define pb push_back
#define pqueue priority_queue
#define int long long
#define pii pair<int,int>
#define supercepat ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
using namespace std;
int tc,ans=0,n,t;
int l[100005];
int e[100005];
int k[100005];
int memo[1005][2005][2005];
bool vis[1005][2005][2005];
int dp(int idx,int r,int eg){
if(vis[idx][r][eg]) return memo[idx][r][eg];
vis[idx][r][eg]=1;
if(idx==n+1) return 0;
if(eg==0) return 0;
if(r>0&&eg>=e[idx]){
memo[idx][r][eg]=max(dp(idx+1,k[idx+1],eg-e[idx])+l[idx],dp(idx,r-1,eg-e[idx])+l[idx]);
}
memo[idx][r][eg]=max(memo[idx][r][eg],dp(idx+1,k[idx+1],eg));
return memo[idx][r][eg];
}
main(){
supercepat;
cin>>t>>n;
for(int i=1;i<=n;i++){
cin>>l[i]>>e[i]>>k[i];
}
cout<<dp(1,k[n],t)<<endl;
}