oj.uz

Submission #890281

# Submission time Handle Problem Language Result Execution time Memory
890281 2023-12-20T23:05:34 Z thunopro Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1 ms 2648 KB 
#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 ; 
int A , B ; 

bool dp [2009][2009] ; 
ll sum [maxn] ; 
ll ans ; 

bool check ( int bit ) 
{
	for ( int i = 0 ; i <= 100 ; i ++ ) for ( int j = 0 ; j <= 100 ; j ++ ) dp [i][j] = false ;
	dp [0][0] = true ; 
	for ( int i = 0 ; i < n ; i ++ ) 
	{
		for ( int j = 0 ; j <= i ; j ++ ) 
		{
			for ( int t = i+1 ; t <= n ; t ++ ) 
			{
				ll value = sum [t] - sum [i] ; 
				if ( value >> bit & 1 ^ 1 && (value&ans) == ans && (value|ans) <= ans+(1ll<<bit)) dp [t][j+1] |= dp [i][j] ;  
			}
		}
	}
	for ( int j = A ; j <= B ; j ++ ) 
	{
		if ( dp [n][j] ) return true ; 
	}
	return false ; 
}
void sub1 () 
{
	for ( int bit = 40 ; bit >= 0 ; bit -- ) 
	{
		if ( !check(bit) ) ans |= (1ll<<bit) ; 
	}
	cout << ans ; 
}
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 ++ ) 
	{
		int x ; cin >> x ; 
		sum [i] = sum [i-1] + x ; 
	}
	
	if ( n <= 100 ) sub1 () ;  
}




//-std=c++11

Compilation message

sculpture.cpp: In function 'bool check(int)':
sculpture.cpp:61:23: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   61 |     if ( value >> bit & 1 ^ 1 && (value&ans) == ans && (value|ans) <= ans+(1ll<<bit)) dp [t][j+1] |= dp [i][j] ;
      |          ~~~~~~~~~~~~~^~~
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.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2408 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 1 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -