제출 #670893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
670893		Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	15 ms	31960 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;
int a[maxn];
int dp[maxn][maxn];

int recur(int pos, int k, int tot, int Or){
	if(k>B) return LINF;
	if(dp[pos][k]!=-1) return dp[pos][k];
	if(pos==n){
		if(k<A or k>B) return LINF;
		return Or|tot;
	}
	int x1 = recur(pos+1,k,tot+a[pos],Or);
	int x2 = recur(pos+1,k+1,a[pos],Or|tot);
	return dp[pos][k] = min(x1,x2);
}

int32_t main() {
	cin >> n >> A >> B; memset(dp,-1,sizeof(dp));
	for(int i = 0; i < n; i++) cin >> a[i];
	cout << recur(0,1,0,0);
}

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