# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805628 | WLZ | Packing Biscuits (IOI20_biscuits) | C++17 | 1151 ms | 1608040 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 "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "../../templates/debug.h"
#else
#define debug(...) 0
#endif
const int X = 130;
long long count_tastiness(long long x, std::vector<long long> a) {
for (int i = 0; i < (int) a.size(); i++) {
if (a[i] > x) {
if (i == (int) a.size() - 1) a.push_back(0);
a[i + 1] += (a[i] - x) / 2;
a[i] -= (a[i] - x) / 2 * 2;
}
}
while ((int) a.size() < X) a.push_back(0);
long long ans = 0;
vector< vector< vector<long long> > > dp(X, vector< vector<long long> >(2, vector<long long>(2 * x + 5, 0)));
dp[0][1][0] = 1;
for (int i = 0; i < X - 1; i++) {
for (int j = x; j < 2 * x + 5; j++) dp[i][1][j - x] += dp[i][0][j];
for (int e = 0; e < 2; e++) {
for (int j = 0; j < 2 * x + 5; j++) {
//if (i < 5) debug(ans);
if (e == 1) ans += dp[i][e][j];
dp[i + 1][0][j / 2 + a[i]] += dp[i][e][j];
}
}
}
debug(dp);
return ans;
}
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... |