oj.uz

Submission #890349

# Submission time Handle Problem Language Result Execution time Memory
890349 2023-12-21T04:13:02 Z thunopro Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 276 ms 2656 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+(1ll<<bit)-1 ) 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 F [2009] ; 
bool _check ( int bit ) 
{
	memset ( F , 0x3f , sizeof F ) ;  
	F [0] = 0 ; 
	for ( int i = 0 ; i < n ; i ++ ) 
	{
		for ( int t = i+1 ; t <= n ; t ++ ) 
		{
			ll value = sum [t] - sum [i] ; 
			if ( value >> bit & 1 ^ 1 && (value|ans) <= ans+(1ll<<bit)-1 ) chkmin (F[t],F[i]+1) ; 
		}
	}
	return (F[n] <= B) ; 
}
void sub2 () 
{
	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 () ;  
	else sub2 () ; 
}
 
 
 
 
//-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+(1ll<<bit)-1 ) dp [t][j+1] |= dp [i][j] ;
      |          ~~~~~~~~~~~~~^~~
sculpture.cpp: In function 'bool _check(int)':
sculpture.cpp:89:22: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   89 |    if ( value >> bit & 1 ^ 1 && (value|ans) <= ans+(1ll<<bit)-1 ) chkmin (F[t],F[i]+1) ;
      |         ~~~~~~~~~~~~~^~~
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
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2512 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2516 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2468 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2524 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2408 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 2 ms 2512 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2524 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 4 ms 2396 KB Output is correct
27 Correct 6 ms 2392 KB Output is correct
28 Correct 8 ms 2396 KB Output is correct
29 Correct 8 ms 2520 KB Output is correct
30 Correct 8 ms 2396 KB Output is correct
31 Correct 8 ms 2396 KB Output is correct
32 Correct 8 ms 2648 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2520 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2648 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 2 ms 2392 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 2 ms 2396 KB Output is correct
45 Correct 2 ms 2656 KB Output is correct
46 Correct 2 ms 2396 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 2 ms 2396 KB Output is correct
49 Correct 4 ms 2396 KB Output is correct
50 Correct 6 ms 2516 KB Output is correct
51 Correct 8 ms 2392 KB Output is correct
52 Correct 8 ms 2396 KB Output is correct
53 Correct 8 ms 2396 KB Output is correct
54 Correct 8 ms 2396 KB Output is correct
55 Correct 8 ms 2396 KB Output is correct
56 Correct 2 ms 2396 KB Output is correct
57 Correct 6 ms 2396 KB Output is correct
58 Correct 8 ms 2396 KB Output is correct
59 Correct 10 ms 2396 KB Output is correct
60 Correct 8 ms 2396 KB Output is correct
61 Correct 8 ms 2520 KB Output is correct
62 Correct 9 ms 2396 KB Output is correct
63 Correct 9 ms 2396 KB Output is correct
64 Correct 5 ms 2396 KB Output is correct
65 Correct 2 ms 2396 KB Output is correct
66 Correct 3 ms 2396 KB Output is correct
67 Correct 5 ms 2396 KB Output is correct
68 Correct 8 ms 2396 KB Output is correct
69 Correct 12 ms 2520 KB Output is correct
70 Correct 8 ms 2396 KB Output is correct
71 Correct 8 ms 2516 KB Output is correct
72 Correct 9 ms 2396 KB Output is correct
73 Correct 9 ms 2516 KB Output is correct
74 Correct 9 ms 2396 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2392 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 2 ms 2396 KB Output is correct
32 Correct 2 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 2 ms 2396 KB Output is correct
35 Correct 3 ms 2396 KB Output is correct
36 Correct 4 ms 2520 KB Output is correct
37 Correct 6 ms 2396 KB Output is correct
38 Correct 8 ms 2516 KB Output is correct
39 Correct 8 ms 2520 KB Output is correct
40 Correct 8 ms 2396 KB Output is correct
41 Correct 8 ms 2396 KB Output is correct
42 Correct 8 ms 2396 KB Output is correct
43 Correct 2 ms 2396 KB Output is correct
44 Correct 6 ms 2396 KB Output is correct
45 Correct 8 ms 2396 KB Output is correct
46 Correct 10 ms 2396 KB Output is correct
47 Correct 8 ms 2396 KB Output is correct
48 Correct 8 ms 2396 KB Output is correct
49 Correct 9 ms 2396 KB Output is correct
50 Correct 9 ms 2520 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 21 ms 348 KB Output is correct
53 Correct 35 ms 348 KB Output is correct
54 Correct 68 ms 724 KB Output is correct
55 Correct 65 ms 348 KB Output is correct
56 Correct 275 ms 348 KB Output is correct
57 Correct 276 ms 596 KB Output is correct
58 Correct 142 ms 492 KB Output is correct
59 Correct 70 ms 488 KB Output is correct
60 Correct 80 ms 504 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 31 ms 472 KB Output is correct
63 Correct 60 ms 476 KB Output is correct
64 Correct 53 ms 348 KB Output is correct
65 Correct 97 ms 348 KB Output is correct
66 Correct 136 ms 488 KB Output is correct
67 Correct 174 ms 488 KB Output is correct
68 Correct 172 ms 484 KB Output is correct
69 Correct 170 ms 348 KB Output is correct