Submission #959596

#	Time	Username	Problem	Language	Result	Execution time	Memory
959596		12345678	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1073 ms	436 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int kx=30, nx=1e5+5;

long long count_tastiness(long long x, std::vector<long long> a) {
    ll res=0;
    vector<ll> c(kx);
	for (int i=0; i<min(kx, (int)a.size()); i++) c[i]=a[i];
	for (ll i=0; i<nx; i++)
    {
        if (i*x>nx) break;
        bool f=0;
        vector<ll> tmp(kx);
        for (int j=0; j<20; j++) tmp[j]=c[j];
        for (int j=0; j<x; j++)
        {
            ll cur=i, idx=20;
            while (idx>=0&&cur>0)
            {
                if (!tmp[idx]||(1<<idx)>cur) --idx;
                else if ((tmp[idx]*(1<<idx))<cur) cur-= tmp[idx]*(1<<idx), tmp[idx]=0;
                else tmp[idx]-=(cur/(1<<idx)), cur=cur%(1<<idx);
                //if (i==7) cout<<"here "<<idx<<' '<<cur<<'\n';              
            }
            /*
            if (i==7)
            {
                cout<<"cur "<<cur<<'\n';
                cout<<"debug : ";
                for (int k=0; k<4; k++) cout<<tmp[k]<<' ';
                cout<<'\n';
            }*/
            if (cur!=0)
            {
                f=1;
                break;
            }
        }
        if (!f) res++;
    }
    return res;
}

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