제출 #670898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
670898		Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	9 / 100	254 ms	340 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = (int)2e3+10;
const int LINF = (int)1e18;
int n, A, B, ans=LINF;
int a[maxn];
 
int32_t main() {
	cin >> n >> A >> B;
	for(int i = 0; i < n; i++) cin >> a[i];
	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;
		int 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);
	}
	cout << ans;
}

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