Submission #1051736

#	Time	Username	Problem	Language	Result	Execution time	Memory
1051736		fuad27	Packing Biscuits (IOI20_biscuits)	C++17	21 / 100	129 ms	194132 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
using namespace std;
long long X;
vector<long long> A;
int k;
long long dp[61][200020];
long long cnt=0;
long long solve(int i, long long add) {
	if(i == k)return 1;
	if(dp[i][add] != -1)return dp[i][add];
	dp[i][add]=0;
	cnt++;
	if(add+A[i] >= X) {
		dp[i][add] += solve(i+1, (add+A[i]-X)/2);
	}
	dp[i][add] += solve(i+1, (add+A[i])/2);
	return dp[i][add];
}
long long count_tastiness(long long x, std::vector<long long> a) {
	X=x;
	A=a;
	k = 60;
	A.resize(61);
	memset(dp, -1, sizeof dp);
	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;
		}
	}
	long long res = solve(0, 0);
	assert(cnt <= 30*100000);
	return res;
}
 

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