# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
917421 | PieArmy | Knapsack (NOI18_knapsack) | C++17 | 218 ms | 262144 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 fr first
#define sc second
#define pb push_back
#define endl '\n';
typedef long long ll;
const ll inf=2000000000000000005;
using namespace std;
ll pie(ll army){return (1ll<<army);}
ll fpow(ll x,ll y,ll m=0){if(y<0){cout<<"powError";return -1;}if(m)x%=m;ll res=1;while(y>0){if(y&1)res*=x;x*=x;if(m){x%=m;res%=m;}y>>=1;}return res;}
void code(){
int k,n;cin>>k>>n;
int v[n],w[n],cnt[n];
for(int i=0;i<n;i++)cin>>v[i]>>w[i]>>cnt[i];
vector<vector<int>>dp(n+1,vector<int>(k+1,0));
for(int i=0;i<n;i++){
for(int j=0;j<=k;j++){
for(int l=0;l<=cnt[i];l++){
if(j+(l*w[i])>k)break;
dp[i+1][j+(l*w[i])]=max(dp[i+1][j+(l*w[i])],dp[i][j]+(l*v[i]));
}
}
}
int ans=0;
for(int i=0;i<=k;i++)ans=max(ans,dp[n][i]);
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
bool usaco=0;if(usaco){freopen(".in","r",stdin);freopen(".out","w",stdout);}
int t=1;
if(!t)cin>>t;
while(t--){code();cout<<endl;}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |