Submission #1328464

#TimeUsernameProblemLanguageResultExecution timeMemory
1328464enzyPacking Biscuits (IOI20_biscuits)C++20
0 / 100
1140 ms1120424 KiB
#include "biscuits.h"
#include<bits/stdc++.h>
#define ll long long
#define sz(v) (ll)(v.size())
const int maxk=62;
ll sp[maxk];
using namespace std;
long long count_tastiness(long long x, vector<long long> a){
	while(a.size()<maxk-1) a.push_back(0ll);
	sp[0]=0;
	for(int i=0;i<a.size();i++){
		if(i) sp[i]=sp[i-1];
		sp[i]+=a[i]*(1ll<<i);
	}
	vector<ll>resp; resp.push_back(0ll);
	for(int k=0;k<maxk;k++){
		int t=resp.size();
		for(int i=0;i<t;i++){
			ll y=resp[i];
			if((y+(1ll<<k))*x>sp[k]) break;
			resp.push_back(y+(1ll<<k));
		}
	}
	ll ans=sz(resp);
	return ans;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...