Submission #429332

#	Time	Username	Problem	Language	Result	Execution time	Memory
429332		MarcoMeijer	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	15 ms	1316 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

ll count_tastiness(ll x, vll a) {
    while(a.size() < 60) a.pb(0);
    vll b = a;
    REP(i,1,60) b[i] += b[i-1]/2ll;

    vll dp; dp.assign(61,0);
    dp[0] = 1;

    RE(i,60) {
        if(b[i] < x) {
            dp[i+1] = dp[i];
            continue;
        }

        ll needed = max(0ll, x - a[i])*2ll;
        ll add = 0;
        REV(j,0,i) {
            if(b[j] >= needed+x) add += dp[j], needed = max(0ll, needed+x-a[j])*2ll;
            else needed = max(0ll, needed - a[j])*2ll;
        }
        if(needed == 0) add++;
        dp[i+1] = dp[i] + add;
    }

	return dp[60];
}

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