Submission #671917

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
671917	2022-12-14T08:55:34 Z	Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	25 / 100	33 ms	22792 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = (int)53;
const int INF = (int)1e9;
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{
		int dp[110][2050];
		for(int i = 0; i <= n; i++)
			for(int j = 0; j < 2048; j++)
				dp[i][j]=INF;
		dp[0][0]=0; int sum;
 
		for(int i = 0; i < n; i++)
			for(int j = 0; j < 2048; j++)
				for(int k = i+1; k <= n; k++)
					if(dp[i][j]<INF) sum=pre[k]-pre[i], 
						dp[k][j|sum]=min(dp[k][j|sum], dp[i][j]+1);
		for(int j = 0; j < 2048; 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	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	3 ms	1108 KB	Output is correct
9	Correct	3 ms	1184 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	3 ms	1108 KB	Output is correct
12	Correct	3 ms	1108 KB	Output is correct
13	Correct	31 ms	1108 KB	Output is correct
14	Correct	1 ms	1108 KB	Output is correct
15	Correct	1 ms	1108 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	1108 KB	Output is correct
18	Correct	1 ms	1176 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	1108 KB	Output is correct
21	Correct	7 ms	1108 KB	Output is correct
22	Correct	6 ms	1108 KB	Output is correct
23	Correct	8 ms	1108 KB	Output is correct
24	Correct	4 ms	1108 KB	Output is correct
25	Correct	7 ms	1108 KB	Output is correct
26	Correct	32 ms	1172 KB	Output is correct
27	Correct	1 ms	1108 KB	Output is correct
28	Correct	1 ms	1108 KB	Output is correct
29	Correct	1 ms	1108 KB	Output is correct
30	Correct	2 ms	1108 KB	Output is correct
31	Correct	7 ms	1108 KB	Output is correct
32	Correct	4 ms	1108 KB	Output is correct
33	Correct	30 ms	1108 KB	Output is correct
34	Correct	30 ms	1164 KB	Output is correct
35	Correct	4 ms	1108 KB	Output is correct
36	Correct	30 ms	1108 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1160 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	4 ms	1120 KB	Output is correct
9	Correct	4 ms	1108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	4 ms	1108 KB	Output is correct
12	Correct	4 ms	1108 KB	Output is correct
13	Correct	33 ms	1160 KB	Output is correct
14	Correct	1 ms	1108 KB	Output is correct
15	Correct	1 ms	1108 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	1108 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	1108 KB	Output is correct
21	Correct	7 ms	1108 KB	Output is correct
22	Correct	7 ms	1108 KB	Output is correct
23	Correct	7 ms	1176 KB	Output is correct
24	Correct	4 ms	1108 KB	Output is correct
25	Correct	6 ms	1180 KB	Output is correct
26	Correct	29 ms	1108 KB	Output is correct
27	Correct	2 ms	3412 KB	Output is correct
28	Correct	3 ms	4820 KB	Output is correct
29	Correct	8 ms	12116 KB	Output is correct
30	Correct	10 ms	15260 KB	Output is correct
31	Correct	24 ms	22676 KB	Output is correct
32	Correct	16 ms	22740 KB	Output is correct
33	Correct	16 ms	22664 KB	Output is correct
34	Correct	17 ms	22720 KB	Output is correct
35	Correct	16 ms	22792 KB	Output is correct
36	Correct	18 ms	22748 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	2 ms	1108 KB	Output is correct
7	Correct	2 ms	1108 KB	Output is correct
8	Correct	4 ms	1108 KB	Output is correct
9	Correct	3 ms	1108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	4 ms	1180 KB	Output is correct
12	Correct	3 ms	1108 KB	Output is correct
13	Correct	33 ms	1108 KB	Output is correct
14	Correct	2 ms	3412 KB	Output is correct
15	Correct	3 ms	4820 KB	Output is correct
16	Correct	8 ms	12116 KB	Output is correct
17	Correct	10 ms	15188 KB	Output is correct
18	Correct	19 ms	22740 KB	Output is correct
19	Correct	20 ms	22688 KB	Output is correct
20	Correct	16 ms	22740 KB	Output is correct
21	Correct	18 ms	22728 KB	Output is correct
22	Correct	17 ms	22740 KB	Output is correct
23	Correct	18 ms	22784 KB	Output is correct
24	Correct	3 ms	1108 KB	Output is correct
25	Incorrect	2 ms	1108 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	4 ms	1108 KB	Output is correct
9	Correct	4 ms	1072 KB	Output is correct
10	Correct	3 ms	1108 KB	Output is correct
11	Correct	3 ms	1108 KB	Output is correct
12	Correct	4 ms	1108 KB	Output is correct
13	Correct	33 ms	1180 KB	Output is correct
14	Correct	1 ms	1108 KB	Output is correct
15	Correct	1 ms	1108 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	1108 KB	Output is correct
18	Correct	1 ms	1108 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	1108 KB	Output is correct
21	Correct	6 ms	1108 KB	Output is correct
22	Correct	7 ms	1180 KB	Output is correct
23	Correct	6 ms	1108 KB	Output is correct
24	Correct	4 ms	1108 KB	Output is correct
25	Correct	7 ms	1184 KB	Output is correct
26	Correct	30 ms	1108 KB	Output is correct
27	Correct	1 ms	1108 KB	Output is correct
28	Correct	1 ms	1108 KB	Output is correct
29	Correct	1 ms	1108 KB	Output is correct
30	Correct	2 ms	1108 KB	Output is correct
31	Correct	7 ms	1188 KB	Output is correct
32	Correct	4 ms	1108 KB	Output is correct
33	Correct	29 ms	1108 KB	Output is correct
34	Correct	31 ms	1156 KB	Output is correct
35	Correct	4 ms	1108 KB	Output is correct
36	Correct	30 ms	1108 KB	Output is correct
37	Correct	2 ms	3412 KB	Output is correct
38	Correct	3 ms	4820 KB	Output is correct
39	Correct	8 ms	12076 KB	Output is correct
40	Correct	10 ms	15188 KB	Output is correct
41	Correct	18 ms	22720 KB	Output is correct
42	Correct	16 ms	22704 KB	Output is correct
43	Correct	17 ms	22704 KB	Output is correct
44	Correct	17 ms	22744 KB	Output is correct
45	Correct	17 ms	22740 KB	Output is correct
46	Correct	22 ms	22772 KB	Output is correct
47	Correct	3 ms	1108 KB	Output is correct
48	Incorrect	2 ms	1108 KB	Output isn't correct
49	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	1108 KB	Output is correct
2	Correct	1 ms	1108 KB	Output is correct
3	Correct	1 ms	1108 KB	Output is correct
4	Correct	1 ms	1108 KB	Output is correct
5	Correct	1 ms	1108 KB	Output is correct
6	Correct	1 ms	1108 KB	Output is correct
7	Correct	1 ms	1108 KB	Output is correct
8	Correct	3 ms	1108 KB	Output is correct
9	Correct	4 ms	1188 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	4 ms	1108 KB	Output is correct
12	Correct	4 ms	1108 KB	Output is correct
13	Correct	33 ms	1108 KB	Output is correct
14	Correct	1 ms	1108 KB	Output is correct
15	Correct	1 ms	1108 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	2 ms	1108 KB	Output is correct
18	Correct	6 ms	1108 KB	Output is correct
19	Correct	4 ms	1108 KB	Output is correct
20	Correct	30 ms	1108 KB	Output is correct
21	Correct	30 ms	1108 KB	Output is correct
22	Correct	3 ms	1108 KB	Output is correct
23	Correct	31 ms	1184 KB	Output is correct
24	Correct	2 ms	3412 KB	Output is correct
25	Correct	3 ms	4820 KB	Output is correct
26	Correct	8 ms	12140 KB	Output is correct
27	Correct	10 ms	15188 KB	Output is correct
28	Correct	19 ms	22792 KB	Output is correct
29	Correct	16 ms	22740 KB	Output is correct
30	Correct	16 ms	22700 KB	Output is correct
31	Correct	17 ms	22732 KB	Output is correct
32	Correct	17 ms	22740 KB	Output is correct
33	Correct	21 ms	22740 KB	Output is correct
34	Correct	3 ms	1108 KB	Output is correct
35	Incorrect	2 ms	1108 KB	Output isn't correct
36	Halted	0 ms	0 KB	-

Submission #671917

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