#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cassert>
#include <tuple>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef vector<int> Vi;
typedef vector<LL> VL;
typedef vector<bool> Vb;
typedef vector<vector<int>> Vii;
#define MAXP 61
#define forR(i, n) for (int i = 0; i < (n); i++)
VL preSum(MAXP);
LL count(LL x, VL a, int p) {
// [ 0, 2^p ) ++ [ 2^p , 2^(p+1) )
if (p == 0) {
return a[0] >= x ? 2 : 1;
}
LL count_before_p = count(x, a, p - 1);
if (a[p] >= x) {
return 2 * count_before_p;
} else if (p > 0 && a[p] + (preSum[p - 1] >> p) >= x) {
LL rest = (x - a[p]) * (1LL << p);
for (int c = p - 1; c >= 0 && rest > 0; c--) {
LL cnt = min(a[c], rest / (1LL << c));
rest -= cnt * (1LL << c);
a[c] -= cnt;
}
assert(rest == 0);
LL chooseP = 0;
auto preSumBackup = preSum;
{
forR(i, p) {
preSum[i] = i > 0 ? preSum[i - 1] : 0;
preSum[i] += ((LL)1 << i) * a[i];
}
chooseP = count(x, a, p - 1);
}
preSum = preSumBackup;
return count_before_p + chooseP;
} else {
return count_before_p;
}
}
LL count_tastiness(LL x, VL a) {
int k = a.size();
a.resize(MAXP);
LL c = 0;
forR(i, MAXP) {
a[i] += c; c = 0;
if (a[i] > x) {
c = (a[i] - x) / 2;
a[i] -= c * 2;
}
}
forR(i, MAXP) {
preSum[i] = i > 0 ? preSum[i - 1] : 0;
preSum[i] += ((LL)1 << i) * a[i];
}
return count(x, a, MAXP - 1);
}
#ifdef TEST_LOCAL
int main() {
LL res;
res = count_tastiness(3, VL{ 5,2,1 });
res = count_tastiness(2, VL{ 2,1,2 });
return 0;
}
#endif
Compilation message
biscuits.cpp: In function 'LL count_tastiness(LL, VL)':
biscuits.cpp:66:6: warning: unused variable 'k' [-Wunused-variable]
66 | int k = a.size();
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
2 ms |
296 KB |
Output is correct |
4 |
Correct |
1 ms |
332 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
2 ms |
356 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
2 ms |
332 KB |
Output is correct |
9 |
Correct |
176 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
296 KB |
Output is correct |
3 |
Correct |
1 ms |
296 KB |
Output is correct |
4 |
Correct |
1 ms |
296 KB |
Output is correct |
5 |
Correct |
1 ms |
292 KB |
Output is correct |
6 |
Correct |
2 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
268 KB |
Output is correct |
10 |
Execution timed out |
1082 ms |
332 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
332 KB |
Output is correct |
2 |
Execution timed out |
1081 ms |
1112 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
0 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
2 ms |
296 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
2 ms |
356 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
2 ms |
332 KB |
Output is correct |
23 |
Correct |
176 ms |
344 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
25 |
Correct |
1 ms |
296 KB |
Output is correct |
26 |
Correct |
1 ms |
296 KB |
Output is correct |
27 |
Correct |
1 ms |
296 KB |
Output is correct |
28 |
Correct |
1 ms |
292 KB |
Output is correct |
29 |
Correct |
2 ms |
332 KB |
Output is correct |
30 |
Correct |
1 ms |
332 KB |
Output is correct |
31 |
Correct |
1 ms |
332 KB |
Output is correct |
32 |
Correct |
1 ms |
268 KB |
Output is correct |
33 |
Execution timed out |
1082 ms |
332 KB |
Time limit exceeded |
34 |
Halted |
0 ms |
0 KB |
- |