# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
608485 | CyberCow | Packing Biscuits (IOI20_biscuits) | C++17 | 1099 ms | 74996 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 <vector>
#include <map>
using namespace std;
using ll = long long;
map<ll, ll> dp[150];
ll count_tastiness(ll x, vector<ll> a)
{
for (int i = 0; i < 148; i++)
{
dp[i].clear();
}
for (int i = 0; i < 70; i++)
{
a.push_back(0);
}
ll ans = 1;
dp[0][0] = 1;
for (int i = 0; i < a.size(); i++)
{
for (auto it : dp[i])
{
if ((it.first + a[i] - x) >= 0)
{
dp[i + 1][(it.first + a[i] - x) / 2] += it.second;
ans += it.second;
}
dp[i + 1][(it.first + a[i]) / 2] += it.second;
}
}
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... |