Submission #424030

#	Time	Username	Problem	Language	Result	Execution time	Memory
424030		Apiram	Packing Biscuits (IOI20_biscuits)	C++14	0 / 100	1 ms	332 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, std::vector<long long> a) {
	int64_t counts =0 ;
	/*int64_t covered = 0;
	for (int64_t i =0;i<n;++i){
		int64_t temp = pow(2,i)*arr[i];
		counts+=(covered - temp)/pow(2,i);
		covered = max(covered,temp);
	}*/
	int n = a.size();
	vector<int64_t>extra;
	vector<int64_t>arr(63);
	for (int i = 0;i<n;++i)arr[i]=a[i];
	for (int i =1;i<63;++i){
		if (arr[i-1]>2){
			arr[i]+=arr[i-1]/2;
		}
		else if (arr[i-1]==2){
			extra.push_back(pow(2,i-1));
		}
	}
	for (int i =0;i<63;++i){
		if (arr[i])counts++;
	}
	//for (auto x:arr)cout<<x<<endl;
	
	int64_t cnt = pow(2,counts)-1;
	for (auto x:extra)cnt+=x;
	return cnt;
}

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