# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
789580 | codergirl | Knapsack (NOI18_knapsack) | C++14 | 2 ms | 340 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 <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <cstring>
int main() {
std::vector<long> v, w; long s, n, x, y, z; std::scanf("%ld %ld", &s, &n);// long t = 0;
for (int i=0; i < n; i++) {
std::scanf("%ld %ld %ld", &y, &z, &x);
for (long j=0, t=std::pow(2,j); j < 30; j++) { // && z*t <= s && x != 0
//t = std::pow(2, j);
if (z*t > s) break;
if (x < t) {
v.push_back(y*x); w.push_back(z*x); break;
}
v.push_back(y*t); w.push_back(z*t); x -= t;
if (x == 0) break;
}
}
long arr[2][s+1]; std::memset(arr[0], 0, sizeof(arr[0])); arr[1][0] = 0;
bool a=0, b=1;
for (long i=1; i <= v.size(); i++) {
a = 1-a, b = 1-b;
for (long j=1; j <= s; j++) arr[a][j] = (j-w[i-1] >= 0) ? std::max(arr[b][j-w[i-1]]+v[i-1], arr[b][j]) : arr[b][j];
}
printf("%ld\n", arr[a][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... |