Submission #671909

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
671909	2022-12-14T08:42:08 Z	Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	25 / 100	37 ms	21912 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
const int maxn = (int)53;
const ll LINF = (ll)1e18;
int n, A, B;
ll a[maxn], pre[maxn]; ll ans=LINF;
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;
			ll 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);
		}
	}
	else if(n<=50){
		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][B+1][k]) ans = min(ans, (ll)k);
	}
	else{
		const int mxOR = 2050;
		ll dp[n+1][mxOR];
		for(int i = 0; i <= n; i++)
			for(int j = 0; j < mxOR; j++)
				dp[i][j]=LINF;
		dp[0][0]=0; ll x;
		for(int i = 1; i <= n; i++){
			x=0;
			for(int j = i-1; j>=0; j--){
				x+=a[j];
				for(int k = 0; k < mxOR; k++){
					dp[i][k|x]=min(dp[i][k|x], dp[j][k]+1);
				}
			}
		}
		for(int j = 0; j < mxOR; j++)
			if(dp[n][j]<=B) ans=min(ans,(ll)j);
	}
	cout << ans;
}

Subtask #1
9.0 / 9.0

#	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	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	212 KB	Output is correct
13	Correct	37 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	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 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	212 KB	Output is correct
22	Correct	6 ms	308 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	31 ms	280 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	2 ms	212 KB	Output is correct
31	Correct	6 ms	300 KB	Output is correct
32	Correct	3 ms	212 KB	Output is correct
33	Correct	33 ms	300 KB	Output is correct
34	Correct	34 ms	212 KB	Output is correct
35	Correct	3 ms	212 KB	Output is correct
36	Correct	34 ms	300 KB	Output is correct

Subtask #2
16.0 / 16.0

#	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	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	308 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	212 KB	Output is correct
13	Correct	36 ms	212 KB	Output is correct
14	Correct	1 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	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 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	300 KB	Output is correct
22	Correct	6 ms	300 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	31 ms	212 KB	Output is correct
27	Correct	2 ms	2516 KB	Output is correct
28	Correct	3 ms	3924 KB	Output is correct
29	Correct	8 ms	11220 KB	Output is correct
30	Correct	10 ms	14420 KB	Output is correct
31	Correct	19 ms	21844 KB	Output is correct
32	Correct	16 ms	21844 KB	Output is correct
33	Correct	16 ms	21844 KB	Output is correct
34	Correct	17 ms	21828 KB	Output is correct
35	Correct	18 ms	21852 KB	Output is correct
36	Correct	17 ms	21844 KB	Output is correct

Subtask #3
0 / 21.0

#	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	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	300 KB	Output is correct
9	Correct	4 ms	212 KB	Output is correct
10	Correct	4 ms	304 KB	Output is correct
11	Correct	3 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	34 ms	304 KB	Output is correct
14	Correct	2 ms	2644 KB	Output is correct
15	Correct	3 ms	3924 KB	Output is correct
16	Correct	8 ms	11220 KB	Output is correct
17	Correct	12 ms	14376 KB	Output is correct
18	Correct	18 ms	21808 KB	Output is correct
19	Correct	18 ms	21844 KB	Output is correct
20	Correct	16 ms	21844 KB	Output is correct
21	Correct	16 ms	21840 KB	Output is correct
22	Correct	17 ms	21892 KB	Output is correct
23	Correct	18 ms	21884 KB	Output is correct
24	Runtime error	6 ms	2004 KB	Execution killed with signal 11
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	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	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	304 KB	Output is correct
11	Correct	3 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	35 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	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 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	212 KB	Output is correct
22	Correct	8 ms	212 KB	Output is correct
23	Correct	6 ms	304 KB	Output is correct
24	Correct	3 ms	212 KB	Output is correct
25	Correct	6 ms	304 KB	Output is correct
26	Correct	31 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	2 ms	212 KB	Output is correct
31	Correct	6 ms	212 KB	Output is correct
32	Correct	3 ms	212 KB	Output is correct
33	Correct	32 ms	212 KB	Output is correct
34	Correct	34 ms	284 KB	Output is correct
35	Correct	3 ms	308 KB	Output is correct
36	Correct	34 ms	212 KB	Output is correct
37	Correct	2 ms	2644 KB	Output is correct
38	Correct	3 ms	3924 KB	Output is correct
39	Correct	7 ms	11276 KB	Output is correct
40	Correct	10 ms	14292 KB	Output is correct
41	Correct	21 ms	21832 KB	Output is correct
42	Correct	18 ms	21840 KB	Output is correct
43	Correct	16 ms	21844 KB	Output is correct
44	Correct	16 ms	21848 KB	Output is correct
45	Correct	16 ms	21844 KB	Output is correct
46	Correct	22 ms	21876 KB	Output is correct
47	Correct	5 ms	1108 KB	Output is correct
48	Incorrect	0 ms	212 KB	Output isn't correct
49	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 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	0 ms	212 KB	Output is correct
6	Correct	2 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	292 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	34 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	212 KB	Output is correct
17	Correct	2 ms	304 KB	Output is correct
18	Correct	6 ms	304 KB	Output is correct
19	Correct	3 ms	236 KB	Output is correct
20	Correct	32 ms	212 KB	Output is correct
21	Correct	33 ms	284 KB	Output is correct
22	Correct	3 ms	212 KB	Output is correct
23	Correct	33 ms	212 KB	Output is correct
24	Correct	2 ms	2644 KB	Output is correct
25	Correct	3 ms	3924 KB	Output is correct
26	Correct	8 ms	11220 KB	Output is correct
27	Correct	10 ms	14384 KB	Output is correct
28	Correct	18 ms	21844 KB	Output is correct
29	Correct	15 ms	21820 KB	Output is correct
30	Correct	16 ms	21864 KB	Output is correct
31	Correct	20 ms	21912 KB	Output is correct
32	Correct	16 ms	21868 KB	Output is correct
33	Correct	18 ms	21824 KB	Output is correct
34	Runtime error	6 ms	2092 KB	Execution killed with signal 11
35	Halted	0 ms	0 KB	-

Submission #671909

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0