#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
typedef long long llint;
const int MAXN = 70;
const llint B = 3133731337133731337;
llint x;
llint a[MAXN], val[MAXN];
llint dp[MAXN][10005];
llint calc (int pos, int del) {
if (pos == 61) return 1;
if (dp[pos][del] != -1) return dp[pos][del];
llint ost = val[pos] - del;
llint res = calc(pos + 1, val[pos + 1] - (ost / 2 + a[pos + 1]));
if (ost >= x) {
res += calc(pos + 1, val[pos + 1] - ((ost - x) / 2 + a[pos + 1]));
}
return dp[pos][del] = res;
}
llint count_tastiness (llint X, vector <llint> A) {
x = X;
for (int i = 0; i <= 60; i++) a[i] = 0;
for (int i = 0; i < (int)A.size(); i++) a[i] = A[i];
for (int i = 0; i <= 60; i++) {
val[i] = a[i] + (i == 0 ? 0 : val[i - 1] / 2);
}
memset(dp, -1, sizeof dp);
return calc(0, 0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
5740 KB |
Output is correct |
2 |
Correct |
8 ms |
5740 KB |
Output is correct |
3 |
Correct |
7 ms |
5740 KB |
Output is correct |
4 |
Correct |
7 ms |
5740 KB |
Output is correct |
5 |
Correct |
7 ms |
5740 KB |
Output is correct |
6 |
Correct |
6 ms |
5740 KB |
Output is correct |
7 |
Correct |
6 ms |
5740 KB |
Output is correct |
8 |
Correct |
6 ms |
5740 KB |
Output is correct |
9 |
Correct |
6 ms |
5740 KB |
Output is correct |
10 |
Correct |
6 ms |
5740 KB |
Output is correct |
11 |
Correct |
6 ms |
5740 KB |
Output is correct |
12 |
Correct |
7 ms |
5740 KB |
Output is correct |
13 |
Correct |
6 ms |
5740 KB |
Output is correct |
14 |
Correct |
7 ms |
5740 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
5740 KB |
Output is correct |
2 |
Correct |
5 ms |
5740 KB |
Output is correct |
3 |
Correct |
6 ms |
5740 KB |
Output is correct |
4 |
Correct |
7 ms |
5740 KB |
Output is correct |
5 |
Correct |
7 ms |
5740 KB |
Output is correct |
6 |
Correct |
6 ms |
5740 KB |
Output is correct |
7 |
Correct |
8 ms |
5740 KB |
Output is correct |
8 |
Correct |
7 ms |
5740 KB |
Output is correct |
9 |
Correct |
7 ms |
5888 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
5740 KB |
Output is correct |
2 |
Correct |
24 ms |
5740 KB |
Output is correct |
3 |
Correct |
30 ms |
5852 KB |
Output is correct |
4 |
Correct |
6 ms |
5740 KB |
Output is correct |
5 |
Correct |
6 ms |
5740 KB |
Output is correct |
6 |
Correct |
7 ms |
5740 KB |
Output is correct |
7 |
Correct |
7 ms |
5740 KB |
Output is correct |
8 |
Correct |
68 ms |
5740 KB |
Output is correct |
9 |
Correct |
48 ms |
5740 KB |
Output is correct |
10 |
Correct |
7 ms |
5740 KB |
Output is correct |
11 |
Correct |
8 ms |
5740 KB |
Output is correct |
12 |
Correct |
16 ms |
5740 KB |
Output is correct |
13 |
Correct |
71 ms |
5740 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
15 ms |
11628 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
5740 KB |
Output is correct |
2 |
Correct |
8 ms |
5740 KB |
Output is correct |
3 |
Correct |
7 ms |
5740 KB |
Output is correct |
4 |
Correct |
7 ms |
5740 KB |
Output is correct |
5 |
Correct |
7 ms |
5740 KB |
Output is correct |
6 |
Correct |
6 ms |
5740 KB |
Output is correct |
7 |
Correct |
6 ms |
5740 KB |
Output is correct |
8 |
Correct |
6 ms |
5740 KB |
Output is correct |
9 |
Correct |
6 ms |
5740 KB |
Output is correct |
10 |
Correct |
6 ms |
5740 KB |
Output is correct |
11 |
Correct |
6 ms |
5740 KB |
Output is correct |
12 |
Correct |
7 ms |
5740 KB |
Output is correct |
13 |
Correct |
6 ms |
5740 KB |
Output is correct |
14 |
Correct |
7 ms |
5740 KB |
Output is correct |
15 |
Correct |
7 ms |
5740 KB |
Output is correct |
16 |
Correct |
5 ms |
5740 KB |
Output is correct |
17 |
Correct |
6 ms |
5740 KB |
Output is correct |
18 |
Correct |
7 ms |
5740 KB |
Output is correct |
19 |
Correct |
7 ms |
5740 KB |
Output is correct |
20 |
Correct |
6 ms |
5740 KB |
Output is correct |
21 |
Correct |
8 ms |
5740 KB |
Output is correct |
22 |
Correct |
7 ms |
5740 KB |
Output is correct |
23 |
Correct |
7 ms |
5888 KB |
Output is correct |
24 |
Correct |
15 ms |
5740 KB |
Output is correct |
25 |
Correct |
24 ms |
5740 KB |
Output is correct |
26 |
Correct |
30 ms |
5852 KB |
Output is correct |
27 |
Correct |
6 ms |
5740 KB |
Output is correct |
28 |
Correct |
6 ms |
5740 KB |
Output is correct |
29 |
Correct |
7 ms |
5740 KB |
Output is correct |
30 |
Correct |
7 ms |
5740 KB |
Output is correct |
31 |
Correct |
68 ms |
5740 KB |
Output is correct |
32 |
Correct |
48 ms |
5740 KB |
Output is correct |
33 |
Correct |
7 ms |
5740 KB |
Output is correct |
34 |
Correct |
8 ms |
5740 KB |
Output is correct |
35 |
Correct |
16 ms |
5740 KB |
Output is correct |
36 |
Correct |
71 ms |
5740 KB |
Output is correct |
37 |
Runtime error |
15 ms |
11628 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
38 |
Halted |
0 ms |
0 KB |
- |