# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1080017 | Muhammad_Aneeq | Packing Biscuits (IOI20_biscuits) | C++17 | 171 ms | 436 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 <vector>
#include <iostream>
using namespace std;
long long count_tastiness(long long x, vector<long long> a)
{
if (x==1)
{
int n=a.size();
long long val=0;
for (int i=0;i+1<n;i++)
{
if (a[i]>2)
{
a[i+1]+=(a[i]-1)/2;
a[i]=(a[i]-1+2)%2+1;
}
}
long long cur=0,ans=1;
for (int i=n-1;i>=0;i--)
{
if (a[i]==0)
{
ans*=(cur+1);
cur=0;
}
else
cur=cur*2+a[i];
}
ans*=(cur+1);
return ans;
}
int n=a.size();
int const sz=1e5;
int ans=1;
for (int i=1;i*x<=1e5;i++)
{
vector<long long>z=a;
bool w=1;
for (int j=0;j<x;j++)
{
int f=i;
for (int k=n-1;k>=0;k--)
{
int g=min(z[k],f/(1ll<<k));
z[k]-=g;
f-=(1ll<<k)*g;
}
w=(f==0);
if (w==0)
break;
}
ans+=w;
}
return ans;
}
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... |