Submission #670895

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
670895	2022-12-11T09:29:07 Z	Dan4Life	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1000 ms	296 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = (int)2e3+10;
const int LINF = (int)1e18;
int n, A, B, ans=LINF;
int a[maxn];

void recur(int pos, int k, int tot, int Or){
	if(k>B) return;
	if(pos==n){
		if(k<A) return;
		ans = min(ans, Or|tot); return;
	}
	recur(pos+1,k,tot+a[pos],Or);
	recur(pos+1,k+1,a[pos],Or|tot);
}

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

Subtask #1

0 / 9.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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	7 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	0 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.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	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	7 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	0 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

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	256 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	6 ms	296 KB	Output is correct
14	Correct	13 ms	296 KB	Output is correct
15	Correct	32 ms	212 KB	Output is correct
16	Correct	3 ms	212 KB	Output is correct
17	Execution timed out	1092 ms	212 KB	Time limit exceeded
18	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	288 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	7 ms	296 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Incorrect	0 ms	212 KB	Output isn't correct
16	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	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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	6 ms	212 KB	Output is correct
14	Correct	1 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	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	6 ms	296 KB	Output is correct
21	Correct	6 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	6 ms	296 KB	Output is correct
24	Correct	13 ms	212 KB	Output is correct
25	Correct	34 ms	212 KB	Output is correct
26	Correct	3 ms	212 KB	Output is correct
27	Execution timed out	1089 ms	212 KB	Time limit exceeded
28	Halted	0 ms	0 KB	-