Submission #48149

#	Time	Username	Problem	Language	Result	Execution time	Memory
48149		square1001	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	2 ms	640 KiB

sculpture

#include <vector>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
	int N, A, B;
	cin >> N >> A >> B;
	assert(A == 1);
	vector<int> v(N);
	for (int i = 0; i < N; i++) cin >> v[i];
	long long ret = 0;
	for (int i = 40; i >= 0; i--) {
		vector<int> dp(N + 1, 1 << 30);
		dp[0] = 0;
		for (int j = 1; j <= N; j++) {
			long long cur = 0;
			for (int k = j - 1; k >= 0; k--) {
				cur += v[k];
				if (((cur >> (i + 1)) | ret) == ret && !((cur >> i) & 1)) {
					dp[j] = min(dp[j], dp[k]);
				}
			}
		}
		ret <<= 1;
		if (dp[N] > B) ret++;
	}
	cout << ret << '\n';
	return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29