#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
long long x,cnt,arr1[200001],arr2[200001];
vector<long long> a;
long long count_tastiness(long long X , vector<long long> A){
a = A , x = X;
while(a.size() < 60){
a.push_back(0ll);
}
memset(arr1,-1,sizeof arr1);
arr1[0] = 0;
for(int i = 0 ; i < 60 ; i += 1){
memset(arr2,-1,sizeof arr2);
cnt = 0;
for(int j = 0 ; j <= 200000 ; j += 1){
if(arr1[j] == -1){
break;
}
long long p = arr1[j]+a[i];
arr2[cnt++] = p/2;
if(p >= x){
arr2[cnt++] = (p-x)/2;
}
}
swap(arr1,arr2);
}
long long ret = 0;
for(int i = 0 ; i <= 200000 ; i += 1){
if(arr1[i] == -1){
break;
}
ret += 1;
}
return ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
215 ms |
3404 KB |
Output is correct |
2 |
Correct |
191 ms |
3404 KB |
Output is correct |
3 |
Correct |
181 ms |
3524 KB |
Output is correct |
4 |
Correct |
199 ms |
3404 KB |
Output is correct |
5 |
Correct |
213 ms |
3404 KB |
Output is correct |
6 |
Correct |
250 ms |
3404 KB |
Output is correct |
7 |
Correct |
177 ms |
3408 KB |
Output is correct |
8 |
Correct |
268 ms |
3404 KB |
Output is correct |
9 |
Correct |
193 ms |
3524 KB |
Output is correct |
10 |
Correct |
173 ms |
3404 KB |
Output is correct |
11 |
Correct |
171 ms |
3404 KB |
Output is correct |
12 |
Correct |
202 ms |
3404 KB |
Output is correct |
13 |
Correct |
198 ms |
3404 KB |
Output is correct |
14 |
Correct |
186 ms |
3408 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
190 ms |
3408 KB |
Output is correct |
2 |
Incorrect |
276 ms |
3404 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
223 ms |
3404 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1093 ms |
3404 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
215 ms |
3404 KB |
Output is correct |
2 |
Correct |
191 ms |
3404 KB |
Output is correct |
3 |
Correct |
181 ms |
3524 KB |
Output is correct |
4 |
Correct |
199 ms |
3404 KB |
Output is correct |
5 |
Correct |
213 ms |
3404 KB |
Output is correct |
6 |
Correct |
250 ms |
3404 KB |
Output is correct |
7 |
Correct |
177 ms |
3408 KB |
Output is correct |
8 |
Correct |
268 ms |
3404 KB |
Output is correct |
9 |
Correct |
193 ms |
3524 KB |
Output is correct |
10 |
Correct |
173 ms |
3404 KB |
Output is correct |
11 |
Correct |
171 ms |
3404 KB |
Output is correct |
12 |
Correct |
202 ms |
3404 KB |
Output is correct |
13 |
Correct |
198 ms |
3404 KB |
Output is correct |
14 |
Correct |
186 ms |
3408 KB |
Output is correct |
15 |
Correct |
190 ms |
3408 KB |
Output is correct |
16 |
Incorrect |
276 ms |
3404 KB |
Output isn't correct |
17 |
Halted |
0 ms |
0 KB |
- |