Submission #1015460

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015460		Unforgettablepl	Packing Biscuits (IOI20_biscuits)	C++17	44 / 100	142 ms	15368 KiB

biscuits

#pragma GCC optimize("Ofast","unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int LIMIT = 59;

long long count_tastiness(long long x, std::vector<long long> a) {
	a.resize(LIMIT+1);
	vector<int> pos = {0};
	pos.reserve(300000);
	int sum = 0;
	for(int i=0;i<=LIMIT;i++){
		sum+=(1ll<<i)*a[i];
		auto iter = upper_bound(pos.begin(),pos.end(),sum/x - (1ll<<i));
		for(auto it = pos.begin();it!=iter;it++)pos.emplace_back(*it + (1ll<<i));
	}
	return pos.size();
}

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