# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
789490 | borisAngelov | Packing Biscuits (IOI20_biscuits) | C++17 | 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 "biscuits.h"
#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 65;
int n;
long long x;
long long a[maxn];
map<pair<int, long long>, long long> dp;
long long f(int pos, long long carry)
{
if (pos == n)
{
return carry / x + 1;
}
if (dp.find(make_pair(pos, carry)) != dp.end())
{
return dp[make_pair(pos, carry)];
}
carry += a[pos];
long long ans = f(pos + 1, carry / 2);
if (carry >= x)
{
ans += f(pos + 1, (carry - x) / 2);
}
return dp[make_pair(pos, carry)] = ans;
}
long long count_tastiness(long long X, vector<long long> arr)
{
dp.clear();
n = arr.size();
x = X;
for (int i = 0; i < n; ++i)
{
a[i] = arr[i];
}
return f(0, 0);
}
/*
1
3 3
5 2 1
1
3 2
2 1 2
2
3 3
5 2 1
3 2
2 1 2
*/