Submission #305386

#TimeUsernameProblemLanguageResultExecution timeMemory
305386daniel920712Packing Biscuits (IOI20_biscuits)C++14
0 / 100
1 ms384 KiB
#include "biscuits.h"
#include <stdio.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;
    for(i=0;i<N||con[i];i++)
    {
        con[i]=a[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;
    for(i=0;i<N;i++)
    {
        if(con[i]==0)
        {
            ans=ans*(t+1);
            t=0;
        }
        else
        {
            t+=(long long) (1<<i)*con[i];
        }
        //printf("%lld %lld\n",i,t);
    }

    ans=ans*(t+1);
	return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...