Submission #1301725

#TimeUsernameProblemLanguageResultExecution timeMemory
1301725sanoPacking Biscuits (IOI20_biscuits)C++20
0 / 100
1 ms576 KiB
#include "biscuits.h"
#include <iostream>
#define ll long long
#define vec vector
#define For(i, n) for(ll i = 0; i < n; i++)

using namespace std;

long long count_tastiness(long long x, vector<long long> a) {
	ll poc = 0;
	ll pr = 0;
	ll vys = 1;
	ll n = a.size();
	vec<ll> pp;
	For(i, n){
		if(a[i] == 0) continue;
		if((poc+1) >= (1<<(i-pr))){
			poc += (a[i] * (1<<(i-pr)));
		}
		else{
			pp.push_back(poc);
			pr = i;
			poc = a[i];
		}
	}
	pp.push_back(poc);
	while(!pp.empty()){
		ll x = pp.back(); pp.pop_back();
		vys *= (x+1);
	}
	return vys;
}

#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...