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 = 61;
int s = n-int(a.size());
for(int i = 0; i < s; ++i) a.pb(0);
ll ans = 1;
int sum = 0;
for(int i = 0; i < n; ++i) sum += (1ll<<i) * a[i];
vector<ll> pos_rem;
pos_rem.pb(0);
for(int i = 0; i < n; ++i){
if(a[i] >= x){
ans *= 2;
vector<ll> p;
for(ll y: pos_rem) p.pb(y + (1ll<<i) * (a[i]-x)), p.pb((1ll<<i) * a[i] + y);
pos_rem = p;
}else{
vector<ll> p;
for(ll y: pos_rem){
if(y + a[i] * (1ll<<i)>=x*(1ll<<i)){
p.pb(y+(a[i]-x)*(1ll<<i));
ans++;
}
if(a[i]>0) p.pb(y+a[i]*(1ll<<i));
}
pos_rem = p;
}
}
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... |