| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 864438 | thundereyex | Knapsack (NOI18_knapsack) | C++14 | 92 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>
using namespace std;
int main(){
long long int n,k;
cin>>n>>k;
vector<vector<long long int>>v1;
vector<long long int>v2;
for(int i=0;i<k;i++){
long long int a,b,c;
cin>>a>>b>>c;
if(b<=n){
long long int g= n/b;
for(int j=0;j<min(g,c);j++){
v2.push_back(a);
v2.push_back(b);
v1.push_back(v2);
v2.clear();
}
}
// v2.clear();
}
vector<vector<long long int>>dp(v1.size()+1,vector<long long int>(n+1,0));
// sort(v1.begin(),v1.end(),greater<vector<int>>());
// cout<<v1.size()<<endl;
long long int max1=0;
for(int i=1;i<=v1.size();i++){
for(int j=1;j<=n;j++){
long long int op1=0,op2=0;
if(j>=v1[i-1][1]){
op1=v1[i-1][0]+dp[i-1][j-v1[i-1][1]];
}
op2=dp[i-1][j];
dp[i][j]=max(op1,op2);
// max1=max(dp[i][j],max1);
}
}
cout<<dp[v1.size()][n]<<endl;
}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... | ||||
