#include "biscuits.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
const ll bound = 2 * 1e18;
ll X;
ll ans = 0;
vi A;
bool check(ll num, int idx, ll force)
{
assert(force <= bound);
if (num == 0)
return true;
if (num & (1LL << idx))
{
if (force < X)
return false;
force -= X;
num = num ^ (1LL << idx);
}
force /= 2;
if (idx + 1 < sz(A))
force += A[idx + 1];
return check(num, idx + 1, force);
}
long long count_tastiness(long long _X, std::vector<long long> a)
{
X = _X;
ans = 0;
A = vi(all(a));
for (int i = 0; i <= 100000; ++i)
if (check(i, 0, a[0]))
++ans;
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
300 KB |
Output is correct |
3 |
Correct |
41 ms |
300 KB |
Output is correct |
4 |
Correct |
62 ms |
280 KB |
Output is correct |
5 |
Correct |
52 ms |
284 KB |
Output is correct |
6 |
Correct |
57 ms |
280 KB |
Output is correct |
7 |
Correct |
56 ms |
292 KB |
Output is correct |
8 |
Correct |
56 ms |
212 KB |
Output is correct |
9 |
Correct |
60 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
212 KB |
Output is correct |
11 |
Correct |
7 ms |
212 KB |
Output is correct |
12 |
Correct |
39 ms |
212 KB |
Output is correct |
13 |
Correct |
39 ms |
212 KB |
Output is correct |
14 |
Correct |
28 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
212 KB |
Output is correct |
2 |
Incorrect |
30 ms |
212 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
28 ms |
284 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1090 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
212 KB |
Output is correct |
2 |
Correct |
5 ms |
300 KB |
Output is correct |
3 |
Correct |
41 ms |
300 KB |
Output is correct |
4 |
Correct |
62 ms |
280 KB |
Output is correct |
5 |
Correct |
52 ms |
284 KB |
Output is correct |
6 |
Correct |
57 ms |
280 KB |
Output is correct |
7 |
Correct |
56 ms |
292 KB |
Output is correct |
8 |
Correct |
56 ms |
212 KB |
Output is correct |
9 |
Correct |
60 ms |
212 KB |
Output is correct |
10 |
Correct |
5 ms |
212 KB |
Output is correct |
11 |
Correct |
7 ms |
212 KB |
Output is correct |
12 |
Correct |
39 ms |
212 KB |
Output is correct |
13 |
Correct |
39 ms |
212 KB |
Output is correct |
14 |
Correct |
28 ms |
212 KB |
Output is correct |
15 |
Correct |
22 ms |
212 KB |
Output is correct |
16 |
Incorrect |
30 ms |
212 KB |
Output isn't correct |
17 |
Halted |
0 ms |
0 KB |
- |