Submission #772372

#	Time	Username	Problem	Language	Result	Execution time	Memory
772372		SanguineChameleon	Packing Biscuits (IOI20_biscuits)	C++17	100 / 100	61 ms	1376 KiB

biscuits

#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;

long long mx[60][60];
long long dp[60][60];

long long count_tastiness(long long x, vector<long long> a) {
	a.resize(60);
	long long sum = 0;
	for (int i = 0; i < 60; i++) {
		sum += a[i] << i;
		mx[i][i] = min((1LL << (i + 1)) - 1, sum / x);
	}
	for (int i = 0; i < 60; i++) {
		for (int j = i + 1; j < 60; j++) {
			mx[i][j] = (1LL << (j + 1)) - 1; 
			for (int k = j; k >= i; k--) {
				mx[i][j] = min(mx[i][j], mx[k][k]);
				if (k > i) {
					mx[i][j] &= (1LL << k) - 1;
				}
			}
		}
	}
	for (int i = 0; i < 60; i++) {
		for (int j = i; j < 60; j++) {
			dp[i][j] = (i ? dp[i - 1][j] : 1);
			if (mx[i][j] & (1LL << i)) {
				dp[i][j] += (i ? dp[i - 1][i - 1] : 1);
			}
		}
	}
	return dp[59][59];
}

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