Submission #319726

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
319726	2020-11-06T10:10:31 Z	TeaTime	Bali Sculptures (APIO15_sculpture)	C++17	21 / 100	1000 ms	1252 KB

sculpture

#include<iostream>
#include<vector>
#include <bitset>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef long double ld;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

const ll SZ = 3000, INF = 1e9;

vector<ll> vec;
ll n, a, b;

ll dp[SZ];

bitset<SZ> dp2[SZ];

ll sol(bool fl) {
	ll curMsk = (1ll << 37) - 1;
	for (ll bt = 36; bt >= 0; bt--) {
		ll msk = curMsk ^ (1ll << bt);

		bool k = 0;

		if (!fl) {
			for (int i = 0; i <= n; i++) {
				for (int j = 0; j <= n; j++) dp2[i][j] = 0;
			}

			dp2[0][0] = 1;
			for (int i = 0; i < n; i++) {
				ll s = 0;
				for (int j = i; j >= 0; j--) {
					s += vec[j];
					if ((msk | s) == msk) {
						dp2[i + 1] |= (dp2[j] << 1);
					}
				}
			}

			for (int i = a; i <= b; i++) {
				if (dp2[n][i]) {
					k = 1;
				}
			}
		}
		else {
			dp[0] = 0;
			for (int i = 0; i <= n; i++) dp[i] = INF;

			for (int i = 0; i < n; i++) {
				ll s = 0;
				for (int j = i; j >= 0; j--) {
					s += vec[j];
					if ((msk | s) == msk) {
						dp[i + 1] = min(dp[i + 1], dp[j] + 1);
					}
				}
			}

			if (dp[n] <= b) k = 1;
		}

		if (k) {
			curMsk = msk;
		}
	}

	return curMsk;
}

int main() {
	fastInp;

	cin >> n >> a >> b;

	vec.resize(n);

	for (auto &cur : vec) cin >> cur;

	if (a == 1) {
		cout << sol(0);
	}
	else {
		cout << sol(1);
	}

	return 0;
}

Subtask #1
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	360 KB	Output is correct
14	Incorrect	0 ms	364 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	492 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Incorrect	0 ms	364 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	2 ms	364 KB	Output is correct
15	Correct	2 ms	364 KB	Output is correct
16	Correct	5 ms	364 KB	Output is correct
17	Correct	5 ms	364 KB	Output is correct
18	Correct	6 ms	364 KB	Output is correct
19	Correct	7 ms	364 KB	Output is correct
20	Correct	7 ms	364 KB	Output is correct
21	Correct	7 ms	364 KB	Output is correct
22	Correct	7 ms	364 KB	Output is correct
23	Correct	7 ms	396 KB	Output is correct
24	Correct	7 ms	364 KB	Output is correct
25	Correct	11 ms	364 KB	Output is correct
26	Correct	15 ms	364 KB	Output is correct
27	Correct	20 ms	364 KB	Output is correct
28	Correct	24 ms	364 KB	Output is correct
29	Correct	23 ms	364 KB	Output is correct
30	Correct	26 ms	364 KB	Output is correct
31	Correct	23 ms	364 KB	Output is correct
32	Correct	23 ms	492 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	396 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Incorrect	1 ms	364 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	2 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	2 ms	364 KB	Output is correct
26	Correct	4 ms	364 KB	Output is correct
27	Correct	5 ms	364 KB	Output is correct
28	Correct	8 ms	364 KB	Output is correct
29	Correct	6 ms	364 KB	Output is correct
30	Correct	7 ms	364 KB	Output is correct
31	Correct	7 ms	364 KB	Output is correct
32	Correct	9 ms	360 KB	Output is correct
33	Correct	7 ms	396 KB	Output is correct
34	Correct	7 ms	364 KB	Output is correct
35	Correct	11 ms	364 KB	Output is correct
36	Correct	15 ms	436 KB	Output is correct
37	Correct	20 ms	396 KB	Output is correct
38	Correct	24 ms	364 KB	Output is correct
39	Correct	25 ms	364 KB	Output is correct
40	Correct	27 ms	364 KB	Output is correct
41	Correct	23 ms	364 KB	Output is correct
42	Correct	23 ms	364 KB	Output is correct
43	Correct	2 ms	364 KB	Output is correct
44	Correct	4 ms	364 KB	Output is correct
45	Correct	5 ms	364 KB	Output is correct
46	Correct	4 ms	364 KB	Output is correct
47	Correct	3 ms	364 KB	Output is correct
48	Correct	5 ms	384 KB	Output is correct
49	Correct	7 ms	364 KB	Output is correct
50	Correct	7 ms	364 KB	Output is correct
51	Correct	5 ms	364 KB	Output is correct
52	Correct	62 ms	612 KB	Output is correct
53	Correct	93 ms	672 KB	Output is correct
54	Correct	179 ms	864 KB	Output is correct
55	Correct	152 ms	748 KB	Output is correct
56	Correct	503 ms	1144 KB	Output is correct
57	Correct	484 ms	1252 KB	Output is correct
58	Correct	461 ms	1132 KB	Output is correct
59	Correct	447 ms	1132 KB	Output is correct
60	Execution timed out	1086 ms	1132 KB	Time limit exceeded
61	Halted	0 ms	0 KB	-

Submission #319726

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0