Submission #671919

#	Time	Username	Problem	Language	Result	Execution time	Memory
671919		Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	3 ms	2132 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = (int)53;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int n, A, B;
ll a[maxn], pre[maxn]; ll ans=LINF;
bool dp[maxn][maxn][25][1028];
 
void recur(int pos, int lpos, int knum, int Or){
	if(dp[pos][lpos][knum][Or]) return;
	dp[pos][lpos][knum][Or]=1;
	if(pos==n+1) return;
	if(pos!=n) recur(pos+1, lpos, knum, Or);
	recur(pos+1, pos, knum+1, Or|(pre[pos]-pre[lpos]));
}
 
int32_t main() {
	cin >> n >> A >> B;
	for(int i = 0; i < n; i++) cin >> a[i], pre[i+1]=pre[i]+a[i];
 
	if(n<=20 and 0){
		for(int mask = 0; mask < (1<<n); mask++){
			int num = __builtin_popcount(mask);
			if(num<A or num>B or !(mask&(1<<(n-1)))) continue;
			ll Or = 0, sum = 0;
			for(int i = 0; i < n; i++){
				if(mask&(1<<i)) sum+=a[i], Or|=sum, sum=0;
				else sum+=a[i];
			}
			ans = min(ans, Or);
		}
	}
	else if(n<=50 and 0){
		recur(1,0,1,0);
		for(int i = A+1; i <= B+1; i++)
			for(int k = 0; k < 1028; k++)
				if(dp[n+1][n][B+1][k]) ans = min(ans, (ll)k);
	}
	else{
		int dp[110][2003];
		for (int i = 0; i <= n; i++) {
			for (int j = 0; j <= 2000; j++) {
				dp[i][j] = INF;
			}
		}

		dp[0][0] = 0;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j <= 2000; j++) {
			if (dp[i][j] < INF) {
				int cur_sum = 0;
				for (int k = i; k < n; k++) {
				cur_sum += a[k];
				dp[k + 1][j | cur_sum] = min(dp[k + 1][j | cur_sum], dp[i][j] + 1);
				}
			}
			}
		}
		for (int i = 0; i <= 2000; i++) {
			if (dp[n][i] <= B) {
			cout << i; return 0;
			}
		}
	}
	cout << ans;
}

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