# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
844067 | now_or_never | Knapsack (NOI18_knapsack) | C++14 | 1 ms | 600 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
using namespace std;
const int maxn=1e4+1;
int n, m;
vector<int> w, v;
ll f[maxn];
void solve(int x, int y, int z)
{
int tmp=1;
while(1)
{
if(z - tmp>=0){
w.push_back(tmp*x);
v.push_back(tmp*y);
z-=tmp;
tmp*=2;
} else break;
}
if(z){
w.push_back(z*x);
v.push_back(z*y);
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>m>>n;
for(int i=1;i<=n;i++)
{
int x, y, z; cin>>y>>x>>z;
solve(x, y, z);
}
for(int i=0; i<w.size(); i++)
for(int j=m; j>=w[i]; j--)
f[j]=max(f[j], f[j-w[i]] + v[i]);
cout<<f[m];
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... |