Submission #108062

#	Time	Username	Problem	Language	Result	Execution time	Memory
108062		autumn_eel	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	119 ms	512 KiB

sculpture

#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define INF 0x3f3f3f3f
using namespace std;
typedef pair<int,int>P;
typedef long long ll;

int n,a,b;
int d[3000];
bool dp[200][200];

void solve1(){
	ll ans=0;
	for(int i=39;i>=0;i--){
		memset(dp,0,sizeof(dp));
		dp[0][0]=true;
		rep(j,n)rep(k,n){
			if(!dp[j][k])continue;
			ll sum=0;
			for(int t=j;t<n;t++){
				sum+=d[t];
				if(((sum&~((1LL<<i)-1))|ans)==ans){
					dp[t+1][k+1]=true;
				}
			}
		}
		bool ok=false;
		for(int j=a;j<=b;j++){
			if(dp[n][j])ok=true;
		}
		if(!ok)ans+=(1LL<<i);
	}
	cout<<ans<<endl;
}

int dp2[3000];

void solve2(){
	ll ans=0;
	for(int i=39;i>=0;i--){
		memset(dp2,0x3f,sizeof(dp2));
		dp2[0]=0;
		rep(j,n){
			if(dp2[j]==INF)continue;
			ll sum=0;
			for(int k=j;k<n;k++){
				sum+=d[k];
				if(((sum&~((1LL<<i)-1))|ans)==ans){
					dp2[k+1]=min(dp2[k+1],dp2[j]+1);
				}
			}
		}
		if(dp2[n]>b)ans+=(1LL<<i);
	}
	cout<<ans<<endl;
}
int main(){
	cin>>n>>a>>b;
	rep(i,n){
		scanf("%d",&d[i]);
	}
	if(a!=1){
		solve1();
	}
	else{
		solve2();
	}
}

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:60:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&d[i]);
   ~~~~~^~~~~~~~~~~~

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