# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1082797 | 1tejasjain | Knapsack (NOI18_knapsack) | C++17 | 1054 ms | 604 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>
using namespace std;
#define int long long
typedef long long ll;
//By Tejas India, https://www.linkedin.com/in/1tejasjain/
void call(){
int s, n; cin>>s>>n;
vector<int> maxValueByWeight(s+1, 0);
maxValueByWeight[0] = 0;
for(int item=1; item<=n; item++){
int value, weight, quantity; cin>>value>>weight>>quantity;
// cout<<"Item: "<<item<<endl;
for(int i=1; i<=quantity; i++)
for(int ks = s; ks>=0; ks--){
if(ks-weight>=0)
maxValueByWeight[ks] = max(maxValueByWeight[ks], maxValueByWeight[ks-weight]+value);
// cout<<ks<<": "<<maxValueByWeight[ks]<<" ";
}
// cout<<endl;
}
cout<<maxValueByWeight[s]<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t=1;
//cin>>t;
while(t--){
call();
# | 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... |