Submission #890268

#	Time	Username	Problem	Language	Result	Execution time	Memory
890268		thunopro	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	73 ms	3788 KiB

sculpture

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 300009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1
#define re exit(0);
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1

const int mod = 1e9+7 ; 
const int INF = 1e9 ;
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 

void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow ( a , n / 2 ) ; 
	if ( n % 2 ) return ( 1ll * res * res % mod * a % mod ) ; 
	else return ( 1ll * res * res % mod ) ; 
}

int n , A , B , a [maxn] ; 

void sub1 () 
{
	int res = INF*2 ; 
	for ( int mask = 0 ; mask < (1<<n) ; mask ++ ) 
	{
		int sum_or = 0 , sum = 0 , num = 0 ; 
		for ( int i = 0 ; i <= n ; i ++ ) 
		{
			if ( i == n || mask >> i & 1 ) 
			{
				sum += a [i+1] ; 
				num ++ ; 
				sum_or |= sum ; 
				sum = 0 ; 
			}
			else sum += a [i+1] ;
		}
		if ( num >= A && num <= B ) chkmin (res,sum_or) ; 
	}
	cout << res ; 
}

int sum [maxn] ; 
void sub2 () 
{
	bool dp [59][22][1009] ; 
	memset ( dp , false , sizeof dp ) ; 
	dp [0][0][0] = true ; 
	const int N = 1000 ; 
	for ( int i = 0 ; i < n ; i ++ ) 
	{
		for ( int j = 0 ; j <= min(i,B-1) ; j ++ ) 
		{
			for ( int k = 0 ; k <= N ; k ++ ) 
			{
				if ( !dp[i][j][k] ) continue ; 
				for ( int t = i+1 ; t <= n ; t ++ ) 
				{
					dp [t][j+1][k|(sum[t]-sum[i])] |= dp [i][j][k] ; 
				}
			}
		}
	}
	int res = 2*INF ; 
	for ( int j = 1 ; j <= B ; j ++ ) for ( int t = 0 ; t <= N ; t ++ ) 
	{
		if ( dp [n][j][t] ) res = min (res,t) ;
	}
	cout << res ; 
}
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ; 
	cin >> n >> A >> B ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	for ( int i = 1 ; i <= n ; i ++ ) sum [i] = sum [i-1] + a[i] ; 
	
	if ( n <= 20 ) sub1 () ; 
	else if ( n <= 50 && *max_element (a+1,a+n+1) <= 20 && A == 1 ) sub2 () ; 
}




//-std=c++11

Compilation message (stderr)

sculpture.cpp: In function 'void rf()':
sculpture.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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