oj.uz

Submission #890271

# Submission time Handle Problem Language Result Execution time Memory
890271 2023-12-20T22:40:06 Z thunopro Bali Sculptures (APIO15_sculpture) C++14
25 / 100
 58 ms 3164 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 , A , B , a [maxn] ; 

void sub1 () 
{
	ll res = 1e18 ; 
	for ( int mask = 0 ; mask < (1<<n) ; mask ++ ) 
	{
		ll sum_or = 0 , sum = 0 , num = 0 ; 
		for ( int i = 0 ; i <= n ; i ++ ) 
		{
			if ( i == n || mask >> i & 1 ) 
			{
				if ( i == n && sum == 0 ) continue ; 
				num ++ ; 
				sum += a [i+1] ; 
				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][509] ; 
	memset ( dp , false , sizeof dp ) ; 
	dp [0][0][0] = true ; 
	const int N = 500 ; 
	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 = A ; 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) <= 10 ) sub2 () ; 
}




//-std=c++11

Compilation message

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 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 6 ms 2396 KB Output is correct
8 Correct 53 ms 2396 KB Output is correct
9 Correct 52 ms 2484 KB Output is correct
10 Correct 53 ms 2392 KB Output is correct
11 Correct 56 ms 2488 KB Output is correct
12 Correct 52 ms 2392 KB Output is correct
13 Correct 52 ms 2488 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 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 2 ms 2396 KB Output is correct
20 Correct 6 ms 2396 KB Output is correct
21 Correct 53 ms 2492 KB Output is correct
22 Correct 53 ms 2496 KB Output is correct
23 Correct 51 ms 2396 KB Output is correct
24 Correct 52 ms 2396 KB Output is correct
25 Correct 53 ms 2396 KB Output is correct
26 Correct 52 ms 2396 KB Output is correct
27 Correct 1 ms 2408 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 26 ms 2520 KB Output is correct
31 Correct 51 ms 2496 KB Output is correct
32 Correct 52 ms 2392 KB Output is correct
33 Correct 54 ms 2744 KB Output is correct
34 Correct 58 ms 2396 KB Output is correct
35 Correct 52 ms 2488 KB Output is correct
36 Correct 52 ms 2488 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 58 ms 2396 KB Output is correct
9 Correct 52 ms 2392 KB Output is correct
10 Correct 57 ms 2488 KB Output is correct
11 Correct 54 ms 2396 KB Output is correct
12 Correct 56 ms 2396 KB Output is correct
13 Correct 52 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 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2396 KB Output is correct
20 Correct 7 ms 2396 KB Output is correct
21 Correct 57 ms 2604 KB Output is correct
22 Correct 52 ms 2396 KB Output is correct
23 Correct 51 ms 2392 KB Output is correct
24 Correct 52 ms 2396 KB Output is correct
25 Correct 51 ms 2392 KB Output is correct
26 Correct 52 ms 2396 KB Output is correct
27 Correct 1 ms 3164 KB Output is correct
28 Correct 1 ms 3024 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 1 ms 3164 KB Output is correct
31 Correct 1 ms 2908 KB Output is correct
32 Correct 1 ms 2908 KB Output is correct
33 Correct 1 ms 2904 KB Output is correct
34 Correct 1 ms 2908 KB Output is correct
35 Correct 1 ms 3156 KB Output is correct
36 Correct 1 ms 2908 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 6 ms 2396 KB Output is correct
8 Correct 55 ms 2396 KB Output is correct
9 Correct 53 ms 2396 KB Output is correct
10 Correct 52 ms 2396 KB Output is correct
11 Correct 52 ms 2396 KB Output is correct
12 Correct 52 ms 2488 KB Output is correct
13 Correct 52 ms 2392 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 2 ms 2908 KB Output is correct
19 Correct 1 ms 2908 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 1 ms 2908 KB Output is correct
22 Correct 1 ms 2904 KB Output is correct
23 Correct 1 ms 2904 KB Output is correct
24 Incorrect 1 ms 2396 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 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 2 ms 2396 KB Output is correct
7 Correct 7 ms 2508 KB Output is correct
8 Correct 52 ms 2396 KB Output is correct
9 Correct 52 ms 2392 KB Output is correct
10 Correct 52 ms 2396 KB Output is correct
11 Correct 52 ms 2396 KB Output is correct
12 Correct 53 ms 2396 KB Output is correct
13 Correct 52 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 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 2 ms 2396 KB Output is correct
20 Correct 6 ms 2396 KB Output is correct
21 Correct 51 ms 2396 KB Output is correct
22 Correct 52 ms 2392 KB Output is correct
23 Correct 51 ms 2404 KB Output is correct
24 Correct 52 ms 2392 KB Output is correct
25 Correct 55 ms 2488 KB Output is correct
26 Correct 57 ms 2492 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 26 ms 2396 KB Output is correct
31 Correct 51 ms 2392 KB Output is correct
32 Correct 52 ms 2492 KB Output is correct
33 Correct 52 ms 2396 KB Output is correct
34 Correct 54 ms 2392 KB Output is correct
35 Correct 52 ms 2584 KB Output is correct
36 Correct 53 ms 2392 KB Output is correct
37 Correct 1 ms 3164 KB Output is correct
38 Correct 1 ms 2908 KB Output is correct
39 Correct 1 ms 2908 KB Output is correct
40 Correct 1 ms 2908 KB Output is correct
41 Correct 1 ms 3164 KB Output is correct
42 Correct 1 ms 3164 KB Output is correct
43 Correct 1 ms 3164 KB Output is correct
44 Correct 1 ms 2908 KB Output is correct
45 Correct 1 ms 3024 KB Output is correct
46 Correct 1 ms 2908 KB Output is correct
47 Incorrect 1 ms 2396 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 6 ms 2396 KB Output is correct
8 Correct 53 ms 2488 KB Output is correct
9 Correct 52 ms 2396 KB Output is correct
10 Correct 53 ms 2392 KB Output is correct
11 Correct 52 ms 2488 KB Output is correct
12 Correct 52 ms 2392 KB Output is correct
13 Correct 52 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 2396 KB Output is correct
17 Correct 26 ms 2396 KB Output is correct
18 Correct 53 ms 2500 KB Output is correct
19 Correct 52 ms 2392 KB Output is correct
20 Correct 51 ms 2396 KB Output is correct
21 Correct 52 ms 2396 KB Output is correct
22 Correct 52 ms 2392 KB Output is correct
23 Correct 54 ms 2648 KB Output is correct
24 Correct 1 ms 2904 KB Output is correct
25 Correct 1 ms 2904 KB Output is correct
26 Correct 1 ms 2908 KB Output is correct
27 Correct 1 ms 2908 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 2908 KB Output is correct
30 Correct 1 ms 3008 KB Output is correct
31 Correct 1 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 1 ms 2908 KB Output is correct
34 Incorrect 1 ms 2396 KB Output isn't correct
35 Halted 0 ms 0 KB -