Submission #371327

#	Time	Username	Problem	Language	Result	Execution time	Memory
371327		pit4h	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	2 ms	372 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ull INF = 4e18+1;

ll count_tastiness(ll _x, vector<ll> _a) {
	ull x = _x;
	int k = _a.size();
	vector<ull> a(k); for(int i=0; i<k; ++i) a[i] = _a[i];

	vector<ull> dp(k), dp0(k), pref(k);
	pref[0] = a[0];
	for(int i=1; i<k; ++i) {
		pref[i] = pref[i-1]/2 + a[i];
	}
	for(int i=0; i<k; ++i) {
		if(i>0) {
			dp0[i] = dp[i-1];
		}
		else {
			dp0[i] = 1;
		}
		ull sum = 0;
		dp[i] = 1;
		for(int j=i; j>=0; --j) {
			if(pref[j] >= x + sum) {
				dp[i] += dp0[j];
				if(sum < INF/2 && sum + x < INF/2) {
					sum += x;
					if(a[j] > sum) sum = 0;
					else sum -= a[j];
					sum *= 2;
				}
				else {
					sum = INF;
				}
			}
			else {
				if(a[j] > sum) sum = 0;
				else sum -= a[j];
				if(sum < INF/2LL) sum *= 2LL;
				else sum = INF;
			}
		}
	}
	if(dp[k-1] < 0LL) {
		assert(false);
	}
	return dp[k-1];
}

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