# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837098 | azatega | Packing Biscuits (IOI20_biscuits) | C++14 | 1044 ms | 63300 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 <iostream>
#include <map>
#include <vector>
using namespace std;
#define ll long long
map<pair<int, ll>, ll> memo;
vector<ll> a;
int n;
ll x;
ll compute(int k, ll amount){
if(memo[{k, amount}] > 0)
return memo[{k, amount}];
if(k == a.size() - 1){
// last one
ll res = 1; // can always be zero
if(amount >= x) // can be 1
res++;
memo[{k, amount}] = res;
return res;
}
ll res = 0;
if(amount >= x)
res += compute(k+1, a[k+1] + (amount - x)/2); // can be 1
res += compute(k+1, a[k+1] + amount/2); // can be 0
memo[{k, amount}] = res;
// cout << k << " - " << amount << ": " << memo[{k, amount}] << endl;
return res;
}
long long count_tastiness(long long _x, vector<long long> _a){
memo.clear();
a = _a;
x = _x;
n = _a.size();
for(int i = 0; i < 100; i++)
a.push_back(0);
return compute(0, a[0]);
}
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... |