Submission #1075262

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075262		allin27x	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	23 ms	1112 KiB

biscuits

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

vector<int> S; int X;
unordered_map<int,int> memo;

int dp(int n){
	if (n<=0) return 0;
	if (memo.count(n)) return memo[n];
	int l2=0; int t=1; while (2*t < n) l2++, t*=2;
	return memo[n] = dp(t) + dp(min(1+ S[l2]/X, n) - t);
}

long long count_tastiness(long long x, std::vector<long long> a) {
	memo.clear();
	a.resize(max((int)a.size(), 61ll), 0); int k = a.size();
	vector<int> s(k,0);
	s[0] = a[0]; X=x;
	for (int i = 1; i < k; i++) {
		s[i] = s[i - 1] + a[i] * (1ll<<i);
	}
	S=s;
	memo[1] = 1;
	return dp((int)1e18+2);

}

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