# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095361 | ihne | Knapsack (NOI18_knapsack) | C++17 | 44 ms | 3744 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 pb push_back
const int mn=2000+5;
struct ITEM{
int v,w,k;
ITEM () {}
ITEM(int _v,int _w,int _k):v(_v),w(_w),k(_k){}
bool operator < (const ITEM& o) const {
return v<o.v;
}
} item[100005];
int dp[mn];
vector<int> v[mn];
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int s,n;
cin>>s>>n;
for (int i=1;i<=n;i++){
cin>>item[i].v>>item[i].w>>item[i].k;
}
sort(item+1,item+n+1);
for (int i=n;i>=1;i--){
while (item[i].k&&v[item[i].w].size()<s/item[i].w){
item[i].k--;
v[item[i].w].pb(item[i].v);
}
}
for (int i=1;i<=s;i++){
if (v[i].empty()) continue;
for (int j=0;j<v[i].size();j++){
for (int k=s;k>=i;k--){
dp[k]=max(dp[k],dp[k-i]+v[i][j]);
}
}
}
cout<<dp[s];
}
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... |