제출 #671918

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671918		Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	5 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];
		int dp[110][2050];
		for(int i = 0; i <= n; i++)
			for(int j = 0; j < 2048; j++)
				dp[i][j]=INF;
		dp[0][0]=0; int sum;
 
		for(int i = 0; i < n; i++)
			for(int j = 0; j < 2048; j++)
				for(int k = i+1; k <= n; k++)
					if(dp[i][j]<INF) sum=pre[k]-pre[i], 
						dp[k][j|sum]=min(dp[k][j|sum], dp[i][j]+1);
		for(int j = 0; j < 2048; j++)
			if(dp[n][j]<=B) ans=min(ans,(ll)j);
	cout << ans;
}

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