Submission #348332

#	Time	Username	Problem	Language	Result	Execution time	Memory
348332		dennisstar	Packing Biscuits (IOI20_biscuits)	C++17	0 / 100	1082 ms	492 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"

using namespace std;
using ll = long long;

ll x;

ll sol(vector<ll> a, int mb) {
	if (mb==0) return a[0]>=x?2:1;
	ll r=sol(a, mb-1);
	a[mb]-=x;
	for (int i=mb; i>=0; i--) {
		if (i==0&&a[i]<0) return r;
		if (a[i]>=0) break;
		a[i-1]+=2*a[i], a[i]=0;
	}
	return r+sol(a, mb-1);
}

ll count_tastiness(ll x, vector<ll> a) {
	::x=x;
	return sol(a, a.size()-1);
}

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