Submission #334543

#	Time	Username	Problem	Language	Result	Execution time	Memory
334543		giorgikob	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	23 ms	1388 KiB

biscuits

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define pb push_back
using namespace std;

#include "biscuits.h"
const int K = 60;

long long count_tastiness(long long x, std::vector<long long> a) {

    vector<ll>dp(K+1,0);
    dp[0] = 1;
    while(a.size() < K+5) a.pb(0);

    vector<ll>gg(K+1,0),g(K+1,0);
    for(int i = 0; i <= K; i++){
        //if(a[i] > x) gg[i] = x*(1LL<<i), a[i] -= x, g[i] = x; else gg[i] = a[i]*(1LL<<i), g[i] = a[i], a[i] = 0;
        //if(i) gg[i] += gg[i-1];
        //a[i+1] += a[i]/2;
        gg[i] = a[i] * (1LL<<i);
        if(i) gg[i] += gg[i-1];
    }

    for(ll i = 1; i <= K; i++){

        ll y = gg[i-1];
        //cout << y << endl;
        for(int k = i-1; k >= 0; k--){
            if((1LL<<k) > (1LL<<K)/x) continue;
            y = min(y,gg[k]);
            if(y < (1LL<<k)*x) continue;
            dp[i] += dp[k];
            y -= (1LL<<k)*x;
            //cout << y << " " << k << endl;
        }
        dp[i]++;
    }
    //cout << endl;
    return dp[K];
}

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