Submission #342544

#	Time	Username	Problem	Language	Result	Execution time	Memory
342544		NhatMinh0208	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	108 ms	492 KiB

sculpture

/*
	Normie's Template v2.0
*/
 
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;
 
//Pragmas (Comment out these three lines if you're submitting in szkopul.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define nfio cin.tie(0);cout.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;
//---------END-------//
ll poss[101][101];
ll minn[2001];
ll pre[2001];
ll arr[2001];
ll n,m,l,r,cur,i,j,t,t1,u,v,a,b,k;
int check()
{
	if (l==1)
	{
		minn[0]=0;
		for (int i=1;i<=n;i++)
		{
			minn[i]=n+1;
			for (int j=0;j<i;j++) 
			{
				ll u=pre[i]-pre[j];
				if ((u|cur)==cur) 
				minn[i]=min(minn[i],minn[j]+1);
			}
		}
		return (minn[n]<=r);
	}
	else
	{
		for (int i=0;i<=n;i++) for (int j=0;j<=n;j++) poss[i][j]=0;
		poss[0][0]=1;
		for (int i=1;i<=n;i++) for (int k=1;k<=i;k++)
		{
			for (int j=0;j<n;j++)
			{
				ll u=pre[i]-pre[j];
				if ((u|cur)==cur) 
				poss[i][k]|=poss[j][k-1];
			}
		}
		int res=0;
		for (int i=l;i<=r;i++) res|=poss[n][i];
		return res;
	}
}
int main()
{
	fio;
	cin>>n>>l>>r;
	for (i=1;i<=n;i++)
	{
		cin>>arr[i];
		pre[i]=pre[i-1]+arr[i];
	}
	cur=(ll(1)<<41)-1;
	for (i=40;i>=0;i--)
	{
		cur^=(ll(1)<<i);
		if (check()); else cur^=(ll(1)<<i);
	}
	cout<<cur;
}

Compilation message (stderr)

sculpture.cpp:20: warning: ignoring #pragma comment  [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/stack:200000000")
      |

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