Submission #338359

#	Time	Username	Problem	Language	Result	Execution time	Memory
338359		mayflyyh	Packing Biscuits (IOI20_biscuits)	C++14	100 / 100	424 ms	1388 KiB

biscuits

#include<bits/stdc++.h>
#define ll long long
ll dp[70];
ll b[170];
ll count_tastiness(ll x, std::vector<ll> a){
	int end=62;
	int SZ=a.size();
	for(int i=0;i<SZ;++i)
		b[i]=a[i];
	for(int i=SZ;i<=end;++i) b[i]=0;
	for(int i=end;i+1;--i){
		if(i==end){
			dp[i]=1;
		}
		else{
			dp[i]=0;
			for(int j=end;j>=i+1;--j){
				ll min=0,max=(1ll<<(j-i))-1,ai=0;
				for(int k=j-1;k>=i;--k){
					ai=ai*2+b[k];
					ll y_=0;
					if(k>i){
						y_=(ai/x+1)<<(k-i);
						if(y_>min)
							min=y_;
					}
					else{
						y_=ai/x;
						if(y_<max)
							max=y_; 
					}
				}
				if(min<=max)
					dp[i]+=dp[j]*(max-min+1);
			}
		}
	}
	return dp[0];
}

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