Submission #305050

#	Time	Username	Problem	Language	Result	Execution time	Memory
305050		CSQ31	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	136 ms	512 KiB

sculpture

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int n,a,b;
bool dp[2001][2001];
ll dp2[2001];
ll d[2001];
bool can(ll mask,bool TYPE){
	if(TYPE == 0){
		for(int i=0;i<=n;i++)
			for(int j=0;j<=b;j++)
				dp[i][j] = 0;
		dp[0][0] = 1;
		for(int i=0;i<=n;i++){
			for(int j=0;j<b;j++){
				if(!dp[i][j])continue;
				ll sum = 0;
				for(int k=i+1;k<=n;k++){
					sum+=d[k];
					if((sum & mask) == 0)dp[k][j+1] = 1;	
				}
			}
		}
	   for(int i=a;i<=b;i++)
		  if(dp[n][i])return true;
		
	   return false;		
	}else{
		for(int i=0;i<=n;i++)dp2[i] = INF;
		dp2[0] = 0;
		for(int i=0;i<=n;i++){
			ll sum = 0;
			for(int j=i+1;j<=n;j++){
				sum+=d[j];
				if((sum & mask) == 0)dp2[j] = min(dp2[j],dp2[i]+1);
			}
			
		}
		return dp2[n] <= b;
	}
}
int main()
{
	cin>>n>>a>>b;
	bool TYPE = a == 1;
	for(int i=1;i<=n;i++)cin>>d[i];
	ll mask = 0;
	for(ll i=60;i>=0;i--){
		if(can(mask | (1LL<<i),TYPE)){
			mask|=(1LL<<i);
		}
	}
	cout<<(mask^((1LL<<61) - 1));
}
/*
6 1 3
8 1 2 1 5 4 
*/

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