Submission #582870

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
582870	2022-06-24T14:14:08 Z	Justin1	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1000 ms	340 KB

sculpture

#include <bits/stdc++.h>
using namespace std;

int n,m,k,x,y,z;
int mn[2005];
int a,b,ar[2005];

void exhaust(int id, int ttl, int sum, int cut) {
	if (id > n) {
		mn[cut] = min(mn[cut],ttl | sum);
		return;
	}
	exhaust(id+1,ttl,sum+ar[id],cut);
	if (id != 1) exhaust(id+1,ttl | sum,ar[id],cut+1);
}

int main() {
	cin >> n >> a >> b;
	for (int i = 1; i <= n; i++) mn[i] = INT_MAX;
	for (int i = 1; i <= n; i++) cin >> ar[i];
	exhaust(1,0,0,1);
	int ans = INT_MAX;
	for (int i = a; i <= b; i++) ans = min(ans,mn[i]);
	cout << ans << "\n";
}

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	1 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	3 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	1 ms	212 KB	Output is correct
18	Correct	1 ms	308 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	3 ms	212 KB	Output is correct
22	Correct	4 ms	212 KB	Output is correct
23	Correct	4 ms	304 KB	Output is correct
24	Correct	3 ms	212 KB	Output is correct
25	Correct	3 ms	212 KB	Output is correct
26	Correct	3 ms	212 KB	Output is correct
27	Incorrect	1 ms	304 KB	Output isn't correct
28	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	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	300 KB	Output is correct
9	Correct	3 ms	212 KB	Output is correct
10	Correct	3 ms	212 KB	Output is correct
11	Correct	4 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	3 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	1 ms	300 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	212 KB	Output is correct
20	Correct	1 ms	308 KB	Output is correct
21	Correct	3 ms	212 KB	Output is correct
22	Correct	3 ms	212 KB	Output is correct
23	Correct	3 ms	212 KB	Output is correct
24	Correct	3 ms	212 KB	Output is correct
25	Correct	3 ms	212 KB	Output is correct
26	Correct	4 ms	212 KB	Output is correct
27	Correct	6 ms	212 KB	Output is correct
28	Correct	83 ms	304 KB	Output is correct
29	Execution timed out	1084 ms	212 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	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	300 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	3 ms	212 KB	Output is correct
14	Correct	6 ms	304 KB	Output is correct
15	Correct	80 ms	280 KB	Output is correct
16	Execution timed out	1075 ms	212 KB	Time limit exceeded
17	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	212 KB	Output is correct
11	Correct	4 ms	212 KB	Output is correct
12	Correct	3 ms	212 KB	Output is correct
13	Correct	3 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	1 ms	340 KB	Output is correct
18	Correct	1 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	3 ms	212 KB	Output is correct
22	Correct	3 ms	212 KB	Output is correct
23	Correct	3 ms	212 KB	Output is correct
24	Correct	4 ms	304 KB	Output is correct
25	Correct	3 ms	212 KB	Output is correct
26	Correct	3 ms	212 KB	Output is correct
27	Incorrect	1 ms	212 KB	Output isn't correct
28	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	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	3 ms	212 KB	Output is correct
14	Incorrect	0 ms	212 KB	Output isn't correct
15	Halted	0 ms	0 KB	-