Submission #304991

#	Time	Username	Problem	Language	Result	Execution time	Memory
304991		Wu_Ren	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	68 ms	1016 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
int n,m;
long long sum[70];
map<long long,long long>dp[70];//第i层，上限为j
long long dfs(int dep,long long lim){
	lim=min(lim,min(sum[dep],(2ll<<dep)-1));
	if(dp[dep].count(lim)) return dp[dep][lim];
	long long _1=1ll<<dep,res=0;
	if(_1<=lim){
		if(dep) res+=dfs(dep-1,lim-_1);
		else res++;
	}
	if(dep) res+=dfs(dep-1,lim);
	else res++;
	return dp[dep][lim]=res;
}
long long count_tastiness(long long x,vector<long long> a){
	for(int i=0;i<=60;i++) sum[i]=((int)a.size()>i?a[i]<<i:0)+sum[i-1];
	for(int i=0;i<=60;i++) dp[i].clear(),sum[i]/=x;
	return dfs(60,1ll<<60);
}

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