Submission #1228053

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228053		Nonoze	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1096 ms	320 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)x.size()
using namespace std;

#define int long long

int count_tastiness(int x, vector<int> a) {
	int n=sz(a);
	int mx=0; for (int i=0; i<n; i++) mx+=(1<<i)*a[i];
	vector<int> pref(1, 0);
	for (int i=0; i<n; i++) pref.pb(pref.back()+a[i]);
	vector<int> b=a;
	int ans=1;
	for (int y=1; y<=mx; y++) {
		int emplbeg=n-1; while ((1<<emplbeg)>y) emplbeg--;
		if (pref[emplbeg+1]<x) continue;
		a=b;
		bool ok=1;
		for (int i=0; i<x; i++) {
			int val=y, empl=emplbeg;
			while (val && empl>=0 && pref[empl]+a[empl]>=(x-i)) {
				if ((1<<empl)>val || !a[empl]) empl--;
				else a[empl]--, val-=(1<<empl);
			}
			if (val) {
				ok=0;
				break;
			}
		}
		ans+=ok;
	}
	return ans;
}

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