Submission #43585

#	Time	Username	Problem	Language	Result	Execution time	Memory
43585		RezwanArefin01	Bali Sculptures (APIO15_sculpture)	C++14	16 / 100	1058 ms	19832 KiB

sculpture

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

typedef long long ll;
typedef pair<int, int> ii; 

unordered_map<ll, ll> dp[110][110]; 

int a[110], p[110], n; 

ll f(int i, int k, ll o) {
	if(k > i) return 1e18; 
	if(k == 1) return p[i] | o;

	if(dp[i][k].count(o)) 
		return dp[i][k][o];

	ll ret = 1e18;

	ll sum = a[i];
	for(int j = i - 1; j >= 1; j--) {
		ret = min(ret, f(j, k - 1, sum | o) | sum | o); 
		sum += a[j];
	}
	return dp[i][k][o] = ret;
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	int n, l, r;
	cin >> n >> l >> r; 
	for(int i = 1; i <= n; i++) {
		cin >> a[i]; p[i] = p[i - 1] + a[i];
	}

	ll ans = 1e18;;

	for(int i = l; i <= r; i++) {
		ans = min(ans, f(n, i, 0));
	}
	cout << ans << endl;

}

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