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 <bits/stdc++.h>
using namespace std;
map<pair<int, long long>, long long> mp;
long long X;
vector<long long> A;
int k;
long long solve(int i, long long add) {
if(i == k)return 1;
if(mp.find({i, add}) != mp.end())return mp[{i, add}];
if(add+A[i] >= X) {
mp[{i, add}] += solve(i+1, (add+A[i]-X)/2);
}
mp[{i, add}] += solve(i+1, (add+A[i])/2);
return mp[{i, add}];
}
long long count_tastiness(long long x, std::vector<long long> a) {
mp.clear();
X=x;
A=a;
k = 60;
A.resize(61);
for(int i = 0;i<k;i++) {
if(A[i] > x) {
long long c = A[i]-x;
A[i+1] += c/2;
c/=2;
c*=2;
A[i] -= c;
}
}
return solve(0, 0);
}
# | 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... |