Submission #1207670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1207670		simona1230	Packing Biscuits (IOI20_biscuits)	C++20	35 / 100	1097 ms	1051112 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long p[64];
long long ans,nd,b[64];
long long s[64];
vector<long long> v;
long long count_tastiness(long long x, std::vector<long long> a)
{
    p[0]=1;
    for(int i=1; i<60; i++)
        p[i]=p[i-1]*2;

    if(x==1)
    {
        for(int i=0;i<a.size();i++)
        {
            if(a[i]>0)
            {
                long long lf=a[i]-1;
                a[i]=1+lf%2;
                a[i+1]+=lf/2;
            }
        }
        ans=1;
        long long curr=1,cnt=0;
        for(int i=0;i<a.size();i++)
        {
            //cout<<a[i]<<" ";
            if(a[i]==0)
            {
                ans*=curr;
                curr=1;
                cnt=0;
            }
            else
            {
                curr+=p[cnt]*a[i];
                cnt++;
            }
        }
        //cout<<endl;
        ans*=curr;
        return ans;
    }

    s[0]=a[0];
    for(int i=1; i<60; i++)
    {
        s[i]=s[i-1];
        if(i<a.size())s[i]+=a[i]*p[i];
    }
    nd=x;
    ans=0;

    v.clear();
    v.push_back(0);
    for(int i=0;i<60;i++)
    {
        int sz=v.size();
        int j=0;
        while(j<sz&&(v[j]+p[i])<=s[i]/nd)
        {
            v.push_back(v[j]+p[i]);
            j++;
        }
    }
    return v.size();
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 21
• Subtask 4: 35 / 35
• Subtask 5: 0 / 23