답안 #1059038

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059038	2024-08-14T16:21:04 Z	sammyuri	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	100 ms	604 KB

sculpture

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

/*
suppose we are trying to satisfy prefix j

let dp[i][0] be the minimum number of segments required to finish at i
and dp[i][1] be the maximum
we can do transitions in O(n^2) and check if dp[n][0] or dp[n][1] is good enough
then we can build from the highest bit down
overall: O(n^2 log y)?
*/

typedef long long ll;
const ll LIMIT = (1ll << 61);

const int MAXN = 2005;
int n;
int a, b;
ll nums[MAXN];
ll dp[MAXN][2];
ll badmask;

bool check() {
    for (int i = 0; i <= n; i ++)
        dp[i][0] = 1e9, dp[i][1] = -1;
    dp[0][0] = dp[0][1] = 0;
    for (int i = 0; i < n; i ++) {
        ll cursum = 0;
        for (int j = i + 1; j <= n; j ++) {
            cursum += nums[j];
            // exceeded limit
            if (cursum >= LIMIT)
                break;
            if ((cursum & badmask) == 0) {
                dp[j][0] = min(dp[j][0], dp[i][0] + 1);
                dp[j][1] = max(dp[j][1], dp[i][1] + 1);
            }
        }
    }
    return (dp[n][0] <= b) && (dp[n][1] >= a);
}


int main() {
    cin >> n >> a >> b;
    for (int i = 1; i <= n; i ++)
        cin >> nums[i];
    ll curbit = LIMIT / 2ll;
    badmask = 0;
    ll ans = 0;
    while (curbit) {
        badmask += curbit;
        if (!check()) {
            badmask -= curbit;
            ans += curbit;
        }
        curbit /= 2;
    }
    cout << ans << endl;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	360 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	344 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	0 ms	344 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	440 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	444 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	604 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	1 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	1 ms	444 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	1 ms	344 KB	Output is correct
61	Correct	0 ms	348 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	1 ms	348 KB	Output is correct
64	Correct	1 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	0 ms	348 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	1 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	344 KB	Output is correct
72	Correct	1 ms	344 KB	Output is correct
73	Correct	0 ms	348 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	360 KB	Output is correct
3	Correct	0 ms	356 KB	Output is correct
4	Correct	0 ms	352 KB	Output is correct
5	Correct	0 ms	352 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	356 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	0 ms	360 KB	Output is correct
18	Correct	0 ms	360 KB	Output is correct
19	Correct	0 ms	360 KB	Output is correct
20	Correct	0 ms	360 KB	Output is correct
21	Correct	0 ms	360 KB	Output is correct
22	Correct	0 ms	360 KB	Output is correct
23	Correct	0 ms	360 KB	Output is correct
24	Correct	0 ms	360 KB	Output is correct
25	Correct	0 ms	360 KB	Output is correct
26	Correct	0 ms	360 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	604 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	344 KB	Output is correct
39	Correct	1 ms	404 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	596 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	1 ms	344 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	604 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	436 KB	Output is correct
52	Correct	9 ms	348 KB	Output is correct
53	Correct	15 ms	464 KB	Output is correct
54	Correct	25 ms	484 KB	Output is correct
55	Correct	24 ms	348 KB	Output is correct
56	Correct	92 ms	476 KB	Output is correct
57	Correct	90 ms	472 KB	Output is correct
58	Correct	92 ms	348 KB	Output is correct
59	Correct	88 ms	348 KB	Output is correct
60	Correct	100 ms	480 KB	Output is correct
61	Correct	1 ms	348 KB	Output is correct
62	Correct	14 ms	460 KB	Output is correct
63	Correct	25 ms	348 KB	Output is correct
64	Correct	24 ms	348 KB	Output is correct
65	Correct	46 ms	348 KB	Output is correct
66	Correct	73 ms	344 KB	Output is correct
67	Correct	90 ms	348 KB	Output is correct
68	Correct	99 ms	480 KB	Output is correct
69	Correct	89 ms	348 KB	Output is correct

답안 #1059038

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
29.0 / 29.0