Submission #1051689

#TimeUsernameProblemLanguageResultExecution timeMemory
1051689fuad27Packing Biscuits (IOI20_biscuits)C++17
0 / 100
1 ms348 KiB
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
map<pair<int, long long>, long long> mp;
long long X;
vector<long long> A;
int k;
//long long solve(int i, long long add) {
//	if(i == k)return 1;
//	if(mp.find({i, add}) != mp.end())return mp[{i, add}];
//	if(add+A[i] >= X) {
//		mp[{i, add}] += solve(i+1, (add+A[i]-X)/2);
//	}
//	mp[{i, add}] += solve(i+1, (add+A[i])/2);
//	return mp[{i, add}];
//}
long long count_tastiness(long long x, std::vector<long long> a) {
	mp.clear();
	X=x;
	A=a;
	k = a.size();
	A.push_back(0);
	long long ans=1;
	for(int i = 0;i<k;i++) {
		if(A[i] > x) {
			long long c = A[i]-x;
			A[i+1] += c/2;
			c/=2;
			c*=2;
			A[i] -= c;
		}

		if(A[i] >= x)ans*=2;
	}
	return ans;
//	return solve(0, 0);
}

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