Submission #1031273

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031273		happy_node	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1053 ms	5136 KiB

biscuits

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

typedef long long ll;

long long count_tastiness(long long X, std::vector<long long> a) {
	while(a.size()<60) a.push_back(0);

	vector<ll> good; // set of good y's
	good.push_back(0);

	ll sum=0;
	for(int b=0;b<60;b++) {	
		sum+=a[b]*(1LL<<b);
		int s=good.size();
		for(int i=0;i<s;i++) {
			ll y=good[i]+(1LL<<b);
			if(y<=sum/X) {
				assert(y>good.back());
				good.push_back(y);
			} else {
				break;
			}
			if(good.size()==200'000) break;
		}
		if(good.size()==200'000) break;
	}

	return good.size();
}

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