# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
837093 | azatega | Packing Biscuits (IOI20_biscuits) | C++17 | 1 ms | 340 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 <map>
#include <vector>
using namespace std;
#define ll long long
map<pair<int, ll>, ll> memo;
vector<ll> a;
ll x;
ll compute(int k, ll amount){
if(memo.count({k, amount}) > 0)
return memo[{k, amount}];
if(k == a.size() - 1){
// last one
ll res = 1;
if(amount >= x)
res++;
memo[{k, amount}] = res;
return res;
}
ll res = 0;
if(amount >= x)
res += compute(k+1, a[k+1] + (amount - x)/2);
res += compute(k+1, a[k+1] + amount/2);
memo[{k, amount}] = res;
return res;
}
long long count_tastiness(long long _x, vector<long long> _a){
memo.clear();
a = _a;
x = _x;
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... |