# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305398 | daniel920712 | Packing Biscuits (IOI20_biscuits) | C++14 | 1 ms | 384 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 <stdio.h>
#include <string.h>
using namespace std;
long long con[105]={0};
long long count_tastiness(long long x,vector<long long> a)
{
long long ans=1,t=0,N=a.size(),i,now,tt=0;
memset(con,0,sizeof(con));
for(i=0;i<N;i++)
{
con[i]=a[i];
con[i+1]+=con[i]%x/2;
con[i]/=x;
}
for(i=0;i<N||con[i];i++)
{
if(con[i]>2)
{
if(con[i]%2==0)
{
con[i+1]+=con[i]/2-1;
con[i]=2;
}
else
{
con[i+1]+=con[i]/2;
con[i]=1;
}
}
}
N=i;
t=0;
now=1;
for(i=0;i<N;i++)
{
if(con[i]==0)
{
ans=ans*(t+1);
t=0;
now=1;
}
else
{
t+=now*con[i];
now*=2;
}
}
ans=ans*(t+1);
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... |