Submission #432803

#	Time	Username	Problem	Language	Result	Execution time	Memory
432803		MOUF_MAHMALAT	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	6 ms	332 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll>a;
ll x,n=61,dp[65][65];
ll best(int d,ll k)
{
    if(d==61)
        return 1;
    k+=a[d];
    ll lg=log2(k);
    ll &r=dp[d][lg];
    if(r!=-1)
        return r;
    if(k>=x)
        return r=best(d+1,k/2)+best(d+1,(k-x)/2);
    return r=best(d+1,k/2);
}
long long count_tastiness(ll X, vector<ll> A)
{
    x=X,a=A,a.resize(n);
    memset(dp,-1,sizeof dp);
    return best(0,0);
}

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