Submission #110959

#	Time	Username	Problem	Language	Result	Execution time	Memory
110959		square1001	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	498 ms	1064 KiB

sculpture

#include <bitset>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int bits = 41;
int main() {
	int N, A, B;
	cin >> N >> A >> B;
	vector<long long> V(N), S(N + 1);
	for(int i = 0; i < N; ++i) {
		cin >> V[i];
		S[i + 1] = S[i] + V[i];
	}
	long long cur = 0;
	for(int i = bits - 1; i >= 0; --i) {
		vector<bitset<2001> > dp(N + 1);
		dp[0][0] = 1;
		for(int j = 1; j <= N; ++j) {
			for(int k = 0; k < j; ++k) {
				long long X = S[j] - S[k];
				if((X | cur | ((1LL << i) - 1)) == (cur | ((1LL << i) - 1))) {
					dp[j] |= dp[k] << 1;
				}
			}
		}
		bool ok = false;
		for(int j = A; j <= B; ++j) {
			if(dp[N][j]) ok = true;
		}
		if(!ok) cur |= 1LL << i;
	}
	cout << cur << endl;
	return 0;
}

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