제출 #629790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
629790		aebov	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	108 ms	352 KiB

sculpture

#include<iostream>
#include<algorithm>
#include<bitset>
#include<vector>
#define ll long long
#define pb push_back
using namespace std;
 
ll dp[2001];
int n,a,b,y[2001];
ll inf = (1LL<<57);
ll ans = (1LL<<57)-1;
bool f()
{
	for(int i=0;i<=n;i++)dp[i]=inf;
	dp[0]=0;
	for(int i=0;i<n;i++){
		ll sum=0;
		for(int j=i;j<n;j++)
		{
			sum += y[j];
			if((sum|ans)==ans)dp[j + 1] = min(dp[j + 1], 1 + dp[i]);
		}
	}
	return dp[n]<=b;
}
void do_job(int pos,int sep,ll sum, ll ret)
{
	if(pos==n){
		if(a<=sep && sep<=b)ans=min(ans,sum|ret);
		return;
	}
	do_job(pos+1,sep,sum+y[pos],ret);
	do_job(pos+1,sep+1,y[pos],sum|ret);
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>a>>b;
	for(int i=0;i<n;i++)cin>>y[i];

	if(n<=20){
		do_job(1,1,y[0],0);
		cout<<ans<<endl;
		return 0;
	}
	for(int i=56;i>=0;i--){
		ans^=(1LL<<i);
		if(!f())ans|=(1LL<<i);
	}
	cout<<ans<<endl;
}

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