Submission #1015430

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015430		Unforgettablepl	Packing Biscuits (IOI20_biscuits)	C++17	9 / 100	1090 ms	1051264 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};
	for(int i=0;i<=LIMIT;i++){
		int curr = pos.size();
		for(int j=0;j<curr;j++){
			pos[j]+=a[i];
			if(pos[j]>=x)pos.emplace_back(pos[j]-x);
		}
		for(int&j:pos)j/=2;
	}
	return pos.size();
}

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