Submission #1168919

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168919		MateiKing80	Packing Biscuits (IOI20_biscuits)	C++20	100 / 100	10 ms	840 KiB

biscuits

#include <iostream>
#include <vector>
#include "biscuits.h"

using namespace std;

typedef long long ll;
#define int ll

int ways[63];
int ct[63];

int count_tastiness(int x, vector<int> a)
{
	int tot = 0;
	ways[0] = 1;
	a.resize(64);
	
	for(int i = 0; i < 62; i ++)
	{
		int way = 0;
		tot += a[i] * (1ll << i);
		ct[i] = tot;
		int tot2 = tot;
		for(int j = i; j >= 0; j --)
		{
			tot2 = min(tot2, ct[j]);
			if((1ll << 62) / x >= (1ll << j) && tot2 >= x * (1ll << j))
				tot2 -= x * (1ll << j), 
				way += ways[j];
		}
		ways[i + 1] = way + 1;
	}
	
	return ways[62];
}

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