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 "biscuits.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
long long count_tastiness(ll x, vector<ll> a)
{
int k = a.size();
vector<ll> sum(k), fold(k);
sum[0] = a[0];
for (int i = 1; i < k; i++)
sum[i] = sum[i - 1] + (a[i] << i);
for (int i = 0; i < k; i++)
if (sum[i] / x / (1LL << i) == 0)
continue;
else
fold[i] = min((1LL << i) - 1, (sum[i] - x * (1LL << i)) / x);
map<ll, ll> mp;
mp[1LL << 62]++;
for (int i = k - 1; i >= 0; i--)
{
map<ll, ll> nxt;
for (auto [p, v] : mp)
if(p >= (1LL << i))
{
nxt[(1LL << i) - 1] += v;
nxt[min(p - (1LL << i), fold[i])] += v;
}
else
nxt[p] += v;
nxt.swap(mp);
}
return mp[0];
}
# | 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... |