Submission #670912

# Submission time Handle Problem Language Result Execution time Memory
670912 2022-12-11T10:13:39 Z Dan4Life Bali Sculptures (APIO15_sculpture) C++17
16 / 100
43 ms 42004 KB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = (int)53;
const ll LINF = (ll)1e18;
int n, A, B;
ll a[maxn], pre[maxn]; int ans=1029;
bool dp[maxn][maxn][25][1028];

void recur(int pos, int lpos, int knum, int Or){
	if(dp[pos][lpos][knum][Or]) return;
	dp[pos][lpos][knum][Or]=1;
	if(pos==n+1) return;
	if(pos!=n) recur(pos+1, lpos, knum, Or);
	recur(pos+1, pos, knum+1, Or|(pre[pos]-pre[lpos]));
}

int32_t main() {
	cin >> n >> A >> B;
	for(int i = 0; i < n; i++) cin >> a[i], pre[i+1]=pre[i]+a[i];

	if(n<=20){
		for(int mask = 0; mask < (1<<n); mask++){
			int num = __builtin_popcount(mask);
			if(num<A or num>B or !(mask&(1<<(n-1)))) continue;
			int Or = 0, sum = 0;
			for(int i = 0; i < n; i++){
				if(mask&(1<<i)) sum+=a[i], Or|=sum, sum=0;
				else sum+=a[i];
			}
			ans = min(ans, Or);
		}
		cout << ans; return 0;
	}
	recur(1,0,1,0);
	for(int i = A+1; i <= B+1; i++)
		for(int k = 0; k < 1028; k++)
			if(dp[n+1][n][i][k]) ans = min(ans, k);
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 256 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 31 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 304 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 308 KB Output is correct
22 Correct 6 ms 304 KB Output is correct
23 Correct 6 ms 212 KB Output is correct
24 Correct 3 ms 304 KB Output is correct
25 Correct 6 ms 212 KB Output is correct
26 Correct 27 ms 284 KB Output is correct
27 Incorrect 0 ms 212 KB Output isn't correct
28 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 312 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 29 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 304 KB Output is correct
22 Correct 6 ms 304 KB Output is correct
23 Correct 5 ms 300 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 6 ms 312 KB Output is correct
26 Correct 27 ms 212 KB Output is correct
27 Correct 2 ms 2612 KB Output is correct
28 Correct 3 ms 3924 KB Output is correct
29 Correct 8 ms 11232 KB Output is correct
30 Correct 10 ms 14312 KB Output is correct
31 Correct 18 ms 21896 KB Output is correct
32 Correct 19 ms 21844 KB Output is correct
33 Correct 17 ms 21880 KB Output is correct
34 Correct 17 ms 21844 KB Output is correct
35 Correct 17 ms 21844 KB Output is correct
36 Correct 17 ms 21888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 312 KB Output is correct
8 Correct 3 ms 308 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 304 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 30 ms 212 KB Output is correct
14 Correct 2 ms 2608 KB Output is correct
15 Correct 3 ms 3924 KB Output is correct
16 Correct 8 ms 11172 KB Output is correct
17 Correct 10 ms 14420 KB Output is correct
18 Correct 18 ms 21872 KB Output is correct
19 Correct 16 ms 21784 KB Output is correct
20 Correct 15 ms 21840 KB Output is correct
21 Correct 17 ms 21844 KB Output is correct
22 Correct 17 ms 21868 KB Output is correct
23 Correct 19 ms 21872 KB Output is correct
24 Runtime error 43 ms 42004 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 300 KB Output is correct
2 Correct 0 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 308 KB Output is correct
13 Correct 29 ms 292 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 304 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 6 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 6 ms 212 KB Output is correct
26 Correct 27 ms 212 KB Output is correct
27 Incorrect 0 ms 212 KB Output isn't correct
28 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 308 KB Output is correct
13 Correct 31 ms 212 KB Output is correct
14 Incorrect 0 ms 312 KB Output isn't correct
15 Halted 0 ms 0 KB -