#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
#define sz(x) (int)(x).size()
#define pb push_back
int k;
vl a;
ll x;
ll tpow[60];
bool possible(ll y){
vl A = a;
for(int i = 0; i <= 59; i++){
if((y>>i)&1){
A[i]-=x;
}
if(A[i] < 0) return 0;
if(i+1 < 60){
A[i+1]+=A[i]/2;
}
}
//cout << y << "\n";
return 1;
}
ll solveCase1(){
while(sz(a) < 60){
a.pb(0);
}
int ans = 0;
for(int y = 0; y <= 100000; y++){
if(possible(y)){
ans++;
}
}
return ans;
}
ll count_tastiness(ll _x, vl _a) {
x = _x;
a = _a;
k = sz(a);
tpow[0] = 1;
for(int i = 1; i <= 59; i++){
tpow[i] = tpow[i-1]*2;
}
bool CASE1 = 1;
if(CASE1){
return solveCase1();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
384 KB |
Output is correct |
2 |
Correct |
47 ms |
364 KB |
Output is correct |
3 |
Correct |
72 ms |
364 KB |
Output is correct |
4 |
Correct |
112 ms |
364 KB |
Output is correct |
5 |
Correct |
95 ms |
364 KB |
Output is correct |
6 |
Correct |
134 ms |
364 KB |
Output is correct |
7 |
Correct |
86 ms |
364 KB |
Output is correct |
8 |
Correct |
137 ms |
492 KB |
Output is correct |
9 |
Correct |
95 ms |
372 KB |
Output is correct |
10 |
Correct |
47 ms |
492 KB |
Output is correct |
11 |
Correct |
56 ms |
364 KB |
Output is correct |
12 |
Correct |
103 ms |
492 KB |
Output is correct |
13 |
Correct |
85 ms |
400 KB |
Output is correct |
14 |
Correct |
68 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
68 ms |
364 KB |
Output is correct |
2 |
Incorrect |
96 ms |
492 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
80 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1088 ms |
364 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
69 ms |
384 KB |
Output is correct |
2 |
Correct |
47 ms |
364 KB |
Output is correct |
3 |
Correct |
72 ms |
364 KB |
Output is correct |
4 |
Correct |
112 ms |
364 KB |
Output is correct |
5 |
Correct |
95 ms |
364 KB |
Output is correct |
6 |
Correct |
134 ms |
364 KB |
Output is correct |
7 |
Correct |
86 ms |
364 KB |
Output is correct |
8 |
Correct |
137 ms |
492 KB |
Output is correct |
9 |
Correct |
95 ms |
372 KB |
Output is correct |
10 |
Correct |
47 ms |
492 KB |
Output is correct |
11 |
Correct |
56 ms |
364 KB |
Output is correct |
12 |
Correct |
103 ms |
492 KB |
Output is correct |
13 |
Correct |
85 ms |
400 KB |
Output is correct |
14 |
Correct |
68 ms |
364 KB |
Output is correct |
15 |
Correct |
68 ms |
364 KB |
Output is correct |
16 |
Incorrect |
96 ms |
492 KB |
Output isn't correct |
17 |
Halted |
0 ms |
0 KB |
- |