| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 540564 | ac2hu | Knapsack (NOI18_knapsack) | C++14 | 0 ms | 0 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>
#ifdef DEBUG
#include "../templates/debug.h"
#else
#define deb(x...)
#endif
using namespace std;
#define int unsigned long long
int dp[(int)1e5 + 100][(int)2e3 + 10];
signed main() {
iostream::sync_with_stdio(false);
cin.tie(nullptr);cout.tie(nullptr);
int s,n;cin >> s >> n;
vector<array<int,3>> items(n);
for(int i = 0;i<n;i++){
for(int j = 0;j<3;j++)cin >> items[i][j];
}
for(int i =0;i<n;i++){
for(int j = 0;j<=s;j++)
dp[i + 1][j] = dp[i][j];
items[i][2] = min(items[i][2], (1 << (int)ceil(log2(s))));
while(items[i][2] > 0){
int lg = log2(items[i][2]);
items[i][2] -= (1 << lg);
for(int mask = 0;mask<=lg;mask++){
for(int j= 1;j<=s;j++){
dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - 1]);
int weight = items[i][1]*(1 << mask);
int price = items[i][0]*(1 << mask);
if(j >= weight)
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j - weight] + price);
}
}
for(int j = 1;j<=s;j++)
dp[i][j] = dp[i + 1][j];
}
}
cout << dp[n][s] << "\n";
}