#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
int x;
vector<int> a;
int recurse(int cur, int i) {
// if(i == 60) {
// cerr << bitset<60>(cur) << " " << i << endl;
// }
if(i == 60) return 1;
a[i+1] += a[i]/2;
int res = recurse(cur, i+1);
a[i+1] -= a[i]/2;
if(a[i] >= x) {
a[i+1] += (a[i]-x)/2;
res += recurse(cur + (1ll<<i), i+1);
a[i+1] -= (a[i]-x)/2;
}
return res;
}
long long count_tastiness(long long x_, vector<long long> a_) {
x=x_; a=a_;
while(a.size() <= 62) a.push_back(0);
int ans = recurse(0, 0);
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
45 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
3 ms |
256 KB |
Output is correct |
4 |
Correct |
75 ms |
256 KB |
Output is correct |
5 |
Correct |
19 ms |
376 KB |
Output is correct |
6 |
Correct |
186 ms |
256 KB |
Output is correct |
7 |
Correct |
12 ms |
256 KB |
Output is correct |
8 |
Correct |
191 ms |
364 KB |
Output is correct |
9 |
Correct |
29 ms |
256 KB |
Output is correct |
10 |
Correct |
0 ms |
256 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
68 ms |
368 KB |
Output is correct |
13 |
Correct |
31 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
45 ms |
256 KB |
Output is correct |
2 |
Execution timed out |
1048 ms |
256 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1091 ms |
256 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1060 ms |
384 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
45 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
3 ms |
256 KB |
Output is correct |
4 |
Correct |
75 ms |
256 KB |
Output is correct |
5 |
Correct |
19 ms |
376 KB |
Output is correct |
6 |
Correct |
186 ms |
256 KB |
Output is correct |
7 |
Correct |
12 ms |
256 KB |
Output is correct |
8 |
Correct |
191 ms |
364 KB |
Output is correct |
9 |
Correct |
29 ms |
256 KB |
Output is correct |
10 |
Correct |
0 ms |
256 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
68 ms |
368 KB |
Output is correct |
13 |
Correct |
31 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
256 KB |
Output is correct |
15 |
Correct |
45 ms |
256 KB |
Output is correct |
16 |
Execution timed out |
1048 ms |
256 KB |
Time limit exceeded |
17 |
Halted |
0 ms |
0 KB |
- |