Submission #1059035

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1059035	2024-08-14T16:18:39 Z	sammyuri	Bali Sculptures (APIO15_sculpture)	C++17	37 / 100	1 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)?
*/
const int MAXN = 2005;
int n;
int a, b;
int nums[MAXN];
int dp[MAXN][2];
int 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 ++) {
        int cursum = 0;
        for (int j = i + 1; j <= n; j ++) {
            cursum += nums[j];
            // exceeded limit
            if (cursum > (1 << 30))
                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];
    int curbit = (1 << 29);
    badmask = 0;
    int ans = 0;
    while (curbit) {
        badmask += curbit;
        if (!check()) {
            badmask -= curbit;
            ans += curbit;
        }
        curbit /= 2;
    }
    cout << ans << endl;
}

Subtask #1
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 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	1 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	1 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	440 KB	Output is correct
22	Correct	0 ms	344 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	Incorrect	0 ms	348 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #2
16.0 / 16.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	440 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	440 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	396 KB	Output is correct
22	Correct	348 KB	Output is correct
23	Correct	348 KB	Output is correct
24	Correct	348 KB	Output is correct
25	Correct	348 KB	Output is correct
26	Correct	344 KB	Output is correct
27	Correct	348 KB	Output is correct
28	Correct	348 KB	Output is correct
29	Correct	604 KB	Output is correct
30	Correct	348 KB	Output is correct
31	Correct	432 KB	Output is correct
32	Correct	348 KB	Output is correct
33	Correct	348 KB	Output is correct
34	Correct	348 KB	Output is correct
35	Correct	348 KB	Output is correct
36	Correct	344 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	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	436 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	436 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	444 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	1 ms	344 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	440 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	352 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	352 KB	Output is correct
29	Correct	0 ms	352 KB	Output is correct
30	Correct	0 ms	352 KB	Output is correct
31	Correct	0 ms	352 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	424 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	344 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	348 KB	Output is correct
21	Correct	348 KB	Output is correct
22	Correct	348 KB	Output is correct
23	Correct	348 KB	Output is correct
24	Correct	348 KB	Output is correct
25	Correct	348 KB	Output is correct
26	Correct	348 KB	Output is correct
27	Correct	348 KB	Output is correct
28	Incorrect	444 KB	Output isn't correct
29	Halted	0 KB	-

Subtask #5
0 / 29.0

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

Submission #1059035

Compilation message

Subtask #1 0 / 9.0

Subtask #2 16.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
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0