| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1292076 | dex111222333444555 | Knapsack (NOI18_knapsack) | C++20 | 1095 ms | 11980 KiB |
#include <bits/stdc++.h>
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
using namespace std;
const int MAXS = 2005, MAXN = 1e5 + 5, LOG = 31;
const long long inf = 1e18 + 3;
template<class X, class Y> bool maximize(X &x, const Y &y){return x < y ? x = y, 1: 0;}
int numVal, lim, val[MAXN], weight[MAXN], num[MAXN], used[MAXS];
long long dp[MAXS];
vector<int> can[MAXN];
void input(){
cin >> lim >> numVal;
for(int i = 1; i <= numVal; i++){
cin >> val[i] >> weight[i] >> num[i];
int sum = 0;
for(int j = 0; j < 31 - __builtin_clz(num[i]); j++){
can[i].push_back(MASK(j)); sum += MASK(j);
}
int m = num[i] - sum;
for(int b = 0; b < LOG; b++) if (BIT(m, b)){
can[i].push_back(MASK(b));
}
}
}
void solve(){
memset(dp, -0x3f, sizeof dp);
dp[0] = 0;
for(int i = 1; i <= numVal; i++){
for(int k = 0; k < can[i].size(); k++){
for(long long j = lim - 1LL * weight[i] * 1LL * can[i][k]; j >= 0; j--) if (dp[j] > -inf){
maximize(dp[j + weight[i] * can[i][k]], dp[j] + 1LL * val[i] * 1LL * can[i][k]);
}
}
}
long long res = -inf;
for(int i = 0; i <= lim; i++) maximize(res, dp[i]);
cout << res << '\n';
}
int main(){
#define task "test"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
input();
solve();
}
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... | ||||
