Submission #1031813

#	Time	Username	Problem	Language	Result	Execution time	Memory
1031813		hotboy2703	Packing Biscuits (IOI20_biscuits)	C++17	35 / 100	7 ms	1284 KiB

biscuits

#include "biscuits.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL<<(i))
namespace trung{
	ll dp[61];
	ll req[61];
	ll sum[61];
	ll a[61];
}
long long count_tastiness(long long x, std::vector<long long> A) {
	using namespace trung;
	for (ll i = 0;i < 60;i ++){
		dp[i] = 0;
		req[i] = 0;
	}
	for (ll i = 0;i < sz(A);i ++)a[i] = A[i];
	for (ll i = 0;i < 60;i ++){
		sum[i] = a[i] * MASK(i);
		if (i)sum[i] += sum[i-1];
		req[i] = (sum[i]/x)-MASK(i);
	}
	for (ll i = 0; i < 60;i ++){
		ll cur = MASK(i+1)-1;
		for (ll j = i;j >= 0;j --){
			if (BIT(cur,j)){
				if (j==0)dp[i]++;
				else dp[i]+=dp[j-1];
				cur -= MASK(j);
				cur = min(cur,req[j]);
				if (cur < 0){
					break;
				}
			}
			if (j==0)dp[i]++;
		}
	}
	return dp[59];
}

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