Submission #1015453

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015453		Unforgettablepl	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1113 ms	276300 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);
	set<int> pos = {0};
	int sum = 0;
	for(int i=0;i<=LIMIT;i++){
		sum+=(1ll<<i)*a[i];
		auto iter = pos.upper_bound(sum/x - (1ll<<i));
		while(iter!=pos.begin()){
			iter--;
			pos.insert(*iter + (1ll<<i));
		}
	}
	return pos.size();
}

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