Submission #422305

#	Time	Username	Problem	Language	Result	Execution time	Memory
422305		Monchito	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	30 ms	368 KiB

biscuits

#include "biscuits.h"
#include <map>
using namespace std;
using ll = long long;
using mp = map<pair<int, ll>, ll>; 

vector<ll> A(200, 0);

ll calc(int current_bit, ll val, mp& dp){
    if(current_bit == 200) return 1;

    if(dp.find({current_bit, val}) != dp.end()) 
        return dp[{current_bit, val}];

    if(val == 0) return dp[{current_bit, val}] = calc(current_bit+1, A[current_bit+1], dp);

    return dp[{current_bit, val}] = calc(current_bit+1, A[current_bit+1] + val/2, dp) + 
                                    calc(current_bit+1, A[current_bit+1] + (val-1)/2, dp);
}

ll count_tastiness(ll x, vector<ll> a) {
    mp dp;
    for(int i=0; i<(int)a.size(); i++) A[i] = a[i];
    return calc(0, A[0], dp);    
}

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