# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602063 | yutabi | Packing Biscuits (IOI20_biscuits) | C++14 | 2 ms | 468 KiB |
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>
using namespace std;
#define pb push_back
typedef long long ll;
long long count_tastiness(long long x, std::vector<long long> a)
{
ll pwr2[61];
pwr2[0]=1;
for(int i=1;i<61;i++)
{
pwr2[i]=pwr2[i-1]*2;
}
while(a.size()<61)
{
a.pb(0);
}
for(int i=0;i<a.size()-1;i++)
{
if(a[i]>x)
{
a[i+1]+=(a[i]-x)/2;
a[i]-=((a[i]-x)/2)*2;
}
}
vector <bool> possible(61,0);
ll spare=0;
for(int i=0;i<61;i++)
{
spare/=2;
spare+=a[i];
if(spare>=x)
{
possible[x]=1;
}
}
ll ans=0;
ll sum=0;
vector <ll> sums;
for(int i=0;i<61;i++)
{
sum+=pwr2[i]*a[i];
sums.pb(sum);
}
sum=0;
vector <ll> res;
for(int i=0;i<61;i++)
{
sum+=pwr2[i]*a[i];
if(sum>=pwr2[i]*x)
{
ll nw_sum=sum-pwr2[i]*x;
ll nw_res;
if(i==0)
{
nw_res=1;
}
else
{
nw_res=res.back()+1;
}
for(int j=i-1;j>=0;j--)
{
nw_sum=min(sums[j],nw_sum);
if(nw_sum>=x*pwr2[j])
{
nw_res+=res[j];
nw_sum-=x*pwr2[j];
}
}
res.pb(nw_res);
}
else
{
if(i==0)
{
res.pb(0);
}
else
{
res.pb(res.back());
}
}
}
return res.back()+1;
}
Compilation message (stderr)
# | 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... |