Submission #1192348

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192348		alexdd	Packing Biscuits (IOI20_biscuits)	C++20	9 / 100	86 ms	328 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
long long count_tastiness(long long x, std::vector<long long> a)
{
    int rez=1;
    for(int y=1;y*x<=100000;y++)
    {
        bool bun=1;
        int pref=0;
        for(int b=0;b<20;b++)
        {
            if((1LL<<b)&y)
            {
                pref += (1LL<<b);
                int sum=0;
                for(int i=0;i<=min(b,(int)a.size()-1);i++)
                    sum += (1LL<<i) * a[i];
                //cerr<<sum<<" vs "<<pref*x<<" zzz\n";
                if(sum < pref*x)
                    bun=0;
            }
        }
        assert(pref == y);
        if(bun)
        {
            //cerr<<y<<" zzz\n";
            rez++;
        }
    }
    return rez;
}
/*

2

3 3
5 2 1

3 2
2 1 2



fie b[0..cntb] bitii de 1 a lui y
ca y sa fie bun:
sum(a[i]*i, i<=b[0]) >= b[0]*x
sum(a[i]*i, i<=b[1]) >= (b[0] + b[1])*x


*/

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