제출 #972594

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972594		Halym2007	Bali Sculptures (APIO15_sculpture)	C++17	50 / 100	66 ms	604 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e3 + 5;
ll n, A, B, dp[N], a[N];
bool check (ll x) {
	for (int i = 1; i <= n; ++i) {
		dp[i] = 1e9;
	}
	for (int i = 1; i <= n; ++i) {
		ll sum = 0;
		for (int j = i; j > 0; j--) {
			sum += a[j];
			if ((sum & x) == sum) {
				dp[i] = min (dp[i], dp[j - 1] + 1);
			}
		}
	}
	return dp[n] <= B;
}


int main () {
//	freopen ("input.txt", "r", stdin);
	cin >> n >> A >> B;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	ll x = (1LL << 42) - 1;
	for (int i = 41; i >= 0; i--) {
		x ^= (1LL << i);
		if (!check(x)) {
			x ^= (1LL << i);
		} 
	}
	cout << x << "\n";
}

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