# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
817723 | Theo830 | 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 <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a;i < b;i++)
#define ll long long
#define ii pair<ll,ll>
#define pb push_back
#define F first
#define S second
#define iii pair<ll,ii>
#include "biscuits.h"
map<ii,ll>dp;
ll a[60] = {0};
ll x;
ll solve(ll extra,ll j){
if(j >= 60){
return 1;
}
if(dp.count(ii(extra,j))){
return dp[{extra,j}];
}
extra += a[j];
ll ans = solve(extra / 2,j+1);
if(extra >= x){
ans += solve((extra - x) / 2,j+1);
}
extra -= a[j];
return dp[{extra,j}] = ans;
}
long long count_tastiness(long long X, vector<long long> A){
dp.clear();
x = X;
ll k = A.size();
f(i,0,k){
a[i] = A[i];
}
return solve(0,j);
}