제출 #671905

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

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
const int maxn = (int)53;
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){
		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){
		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{
		const int mxOR = 5000;
		ll dp[n+1][mxOR];
		for(int i = 0; i <= n; i++)
			for(int j = 0; j < mxOR; j++)
				dp[i][j]=LINF;
		dp[0][0]=0; ll x;
		for(int i = 1; i <= n; i++){
			for(int k = 0; k < mxOR; k++){
				for(int j = i; j>0; j--){
					x+=a[j-1], dp[i][k|x]=min(dp[i][k|x], dp[j][k]+1);
				}
			}
		}
		for(int j = 0; j < mxOR; j++)
			if(dp[n][j]<=B) ans=min(ans,(ll)j);
	}
	cout << ans;
}

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'int32_t main()':
sculpture.cpp:51:7: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   51 |      x+=a[j-1], dp[i][k|x]=min(dp[i][k|x], dp[j][k]+1);
      |      ~^~~~~~~~

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