Submission #1292677

#TimeUsernameProblemLanguageResultExecution timeMemory
1292677julia_08Packing Biscuits (IOI20_biscuits)C++20
0 / 100
1 ms572 KiB
#include <bits/stdc++.h>
#include "biscuits.h"

using ll = long long;

using namespace std;

const int MAXN = 70;

ll a[MAXN], pot[MAXN];

ll count_tastiness(ll x, vector<ll> a_){

	int k = (int) a_.size();

	for(int i=0; i<k; i++) a[i] = a_[i];

	int cnt = 0;

	for(int i=0; i<(k + 4); i++){

		int cur = min(a[i], x);

		cnt += (cur >= x);

		a[i] -= cur;
		a[i + 1] += (a[i] / 2);

	}

	pot[0] = 1;

	for(int i=1; i<=cnt; i++) pot[i] = (pot[i - 1] * 2);

	return pot[cnt];

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