Submission #261343

#	Time	Username	Problem	Language	Result	Execution time	Memory
261343		uacoder123	Bali Sculptures (APIO15_sculpture)	C++14	21 / 100	2 ms	384 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) lli(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
int n,a,b;
int dp[2001],dp2[2001][2001],arr[2001];
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin>>n>>a>>b;
  for(int i=0;i<n;++i)
  	cin>>arr[i];
  lli cur=0;
  if(a==1)
  {
  	for(int i=32;i>=0;--i)
  	{
  		cur+=(1LL<<i);
  		for(int j=0;j<n;++j)
  		{
  			int s=0;
  			dp[j]=100000;
  			for(int k=j;k>=0;--k)
  			{
  				s+=arr[k];
  				if((cur&s)==0)
  					dp[j]=min(dp[j],1+((k==0)?0:dp[k-1]));
  			}
  		}
  		if(dp[n-1]>b)
  			cur-=(1<<i);
  	}
  }
  else
  {
  	for(int i=32;i>=0;--i)
  	{
  		cur+=(1<<i);
  		for(int j=0;j<n;++j)
  		{
  			for(int k=0;k<=b;++k)
  			{
  				int s=0;
  				dp2[j][k]=0;
  				if(k==0)
  					continue;
  				for(int l=j;l>=0;--l)
  				{
  					s+=arr[l];
  					if((cur&s)==0)
  					{
  						if(l==0)
  						{
  							if(k==1)
  								dp2[j][k]=1;
  						}
  						else
  							dp2[j][k]=max(dp2[j][k],dp2[l-1][k-1]);
  					}
  				}
  			}
  		}
  		int ch=0;
  		for(int j=a;j<=b;++j)
  			ch=max(dp2[n-1][j],ch);
  		if(!ch)
  			cur-=(1<<i);
  	}
  }
  cout<<(cur^8589934591)<<endl;
  return(0);
}

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