#include <iostream>
#include "biscuits.h"
#include <vector>
#include <map>
#include <unordered_map>
#define ll long long
#define pll pair<ll, ll>
using namespace std;
unordered_map<ll, ll> dp0, dp1;
long long count_tastiness(long long x, vector<long long> a) {
ll ans = 0;
for (int i = 0; a.size() < 63; i++)
a.push_back(0);
int k = a.size();
dp0[a[0]] = 1;
if (a[0] >= x) {
dp0[a[0] - x] = 1;
}
for (int i = 1; i < k; i++) {
for (pll jp : dp0) {
ll j = jp.first, val = jp.second;
dp1[j / 2 + a[i]] += val;
if (j / 2 + a[i] >= x) {
dp1[j / 2 + a[i] - x] += val;
}
}
/*for (pll jp : dp1) {
cout << i << " " << jp.first << " " << jp.second << endl;
}*/
dp0 = dp1;
dp1.clear();
}
ans = dp0[0];
dp0.clear();
return ans;
}
/*
2
3 2
2 1 2
3 3
5 2 1
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
79 ms |
1868 KB |
Output is correct |
2 |
Correct |
145 ms |
1812 KB |
Output is correct |
3 |
Correct |
247 ms |
1808 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
602 ms |
1876 KB |
Output is correct |
9 |
Correct |
416 ms |
1876 KB |
Output is correct |
10 |
Correct |
2 ms |
212 KB |
Output is correct |
11 |
Correct |
9 ms |
328 KB |
Output is correct |
12 |
Correct |
86 ms |
468 KB |
Output is correct |
13 |
Correct |
622 ms |
1856 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1092 ms |
19024 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
79 ms |
1868 KB |
Output is correct |
25 |
Correct |
145 ms |
1812 KB |
Output is correct |
26 |
Correct |
247 ms |
1808 KB |
Output is correct |
27 |
Correct |
1 ms |
212 KB |
Output is correct |
28 |
Correct |
1 ms |
212 KB |
Output is correct |
29 |
Correct |
1 ms |
212 KB |
Output is correct |
30 |
Correct |
1 ms |
212 KB |
Output is correct |
31 |
Correct |
602 ms |
1876 KB |
Output is correct |
32 |
Correct |
416 ms |
1876 KB |
Output is correct |
33 |
Correct |
2 ms |
212 KB |
Output is correct |
34 |
Correct |
9 ms |
328 KB |
Output is correct |
35 |
Correct |
86 ms |
468 KB |
Output is correct |
36 |
Correct |
622 ms |
1856 KB |
Output is correct |
37 |
Execution timed out |
1092 ms |
19024 KB |
Time limit exceeded |
38 |
Halted |
0 ms |
0 KB |
- |