Submission #303633

#	Time	Username	Problem	Language	Result	Execution time	Memory
303633		cgiosy	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1 ms	384 KiB

biscuits

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

ll count_tastiness(ll x, vector<ll> A) {
	const int N=A.size();
	vector<ll> D(N);
	for(int i=1; i<N; i++) A[i]=A[i-1]+(A[i]<<i);
	D[0]=(A[0]>=x)+1;
	for(int i=1; i<N; i++) {
		ll v=min(max(ll(1)<<i, A[i]/x), (ll(1)<<(i+1))-1);
		D[i]+=(v&1)+1;
		for(int j=1; j<i; j++) if(v&1<<j) D[i]+=D[j-1];
	}
	return accumulate(begin(D), end(D), 0);
}

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