Submission #1228083

#	Time	Username	Problem	Language	Result	Execution time	Memory
1228083		Nonoze	Packing Biscuits (IOI20_biscuits)	C++20	0 / 100	1 ms	328 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);
	for (int i=0; i<n; i++) {
		if (a[i]>2) {
			int val=(a[i]-1)/2;
			a[i]-=val*2;
			if (i==n-1) n++, a.pb(0);
			a[i+1]+=val;
		}
		// cout << a[i] << ' ';
	}
	// cout << endl;
	int ans=1, sm=0, beg=1;
	for (int i=0; i<n; i++) {
		if (sm<(1<<i) && i && !a[i-1]) ans*=sm/beg+1, sm=0;
		if (sm==0) beg=(1<<i);
		sm+=a[i]*(1<<i);
		// cout << ans << ' ' << sm << ' ' << beg << endl;
	}
	return ans*(sm/beg+1);
}

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