This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
int n;
ll count_tastiness(ll x, vector<ll> a){
n = 62;
int s = n - a.size();
for(int i = 0; i < s; ++i) a.pb(0);
ll ans = 0;
int sum = 0;
for(int i = 0; i < n; ++i) sum += (1ll<<i) * a[i];
if(sum/x <= 100000){
for(ll y = 0; y <= sum / x; ++y){
ll c = 0;
bool ok = 1;
for(ll j = 0; j < n; ++j){
if((1ll<<j)&y){
c += a[j];
if(c<x){
ok = 0;
break;
}
c-=x;
}else{
c += a[j];
}
c >>= 1;
}
if(ok) ans++;
}
return ans;
}else{
vector<ll> b = a;
for(int i = 0; i < n - 1; ++i){
if(b[i] > 1) b[i + 1] += (b[i]-1)/2;
}
ll ans = 1;
for(int i = 0; i < n - 1; ++i) if(b[i]>0) ans *= 2;
return ans;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |