Submission #303430

#	Time	Username	Problem	Language	Result	Execution time	Memory
303430		qiangbao	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	7 ms	384 KiB

biscuits

#include <iostream>
#include <vector>
#include "biscuits.h"

using namespace std;

typedef long long ll;

ll ways[63];
ll ct[63];

ll pow2[63];

ll count_tastiness(ll x, vector<ll> a)
{
    ll tot=0;
    ll i, j;
    pow2[0]=1;
    for(i=1;i<=62;i++)
        pow2[i]=pow2[i-1]*2;
    a.resize(64);
    
    for(i=0;i<62;i++){
        ll way=0;
        tot+=a[i]*pow2[i], ct[i]=tot;
        ll tot2=tot;
        for(j=i;j>=0;j--){
            tot2=min(tot2, ct[j]);
            if(pow2[62]/x>=pow2[j] && tot2>=x*pow2[j])
                tot2-=x*pow2[j], way+=ways[j];
        }
        ways[i+1]=way+1;
    }
    
    return ways[62];
}

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