Submission #1031277

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031277		happy_node	Packing Biscuits (IOI20_biscuits)	C++17	44 / 100	120 ms	3676 KiB

biscuits

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

typedef long long ll;

const int MX=2e5+5;

ll good[MX];

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

	good[0]=0;
	int ptr=1;

	ll sum=0;
	for(int b=0;b<60;b++) {
		ll c=1LL<<b;	
		sum+=a[b]*c;
		int tmp=ptr;
		for(int i=0;i<tmp;i++) {
			ll y=good[i]+c;
			if(y<=sum/X) 
				good[ptr++]=y;
			else
				break;
		}
	}

	return ptr;
}

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