Submission #629023

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
629023	2022-08-14T02:54:19 Z	bojackduy	Bigger segments (IZhO19_segments)	C++14	27 / 100	1500 ms	70820 KB

segments

#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef vector<int> vi;
typedef long long ll;
const int N = 1e6 + 1;
int n, res;
int a[N];

int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    vector<vi> dp(n + 1, vi(n + 1, -1e9));
    for (int i = 1; i <= n; i++) dp[i][0] = 1;
    vector<ll> pre(n + 1, 0);
    for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            for (int k = 1; k < j; k++) {
                int sum2 = pre[i] - pre[j - 1];
                int sum1 = pre[j - 1] - pre[k - 1];
                if (sum1 <= sum2) {
                    dp[i][j - 1] = max(dp[i][j - 1], dp[j - 1][k - 1] + 1);
                }
            }
        }
    }
    cout << *max_element(dp[n].begin(), dp[n].end());
    return 0;
}

Subtask #1
13.0 / 13.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	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	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	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct

Subtask #2
14.0 / 14.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	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	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	0 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	43 ms	2296 KB	Output is correct
17	Correct	46 ms	2296 KB	Output is correct
18	Correct	51 ms	2296 KB	Output is correct
19	Correct	35 ms	2260 KB	Output is correct
20	Correct	44 ms	2260 KB	Output is correct
21	Correct	46 ms	2260 KB	Output is correct
22	Correct	22 ms	1492 KB	Output is correct
23	Correct	10 ms	980 KB	Output is correct
24	Correct	44 ms	2260 KB	Output is correct
25	Correct	47 ms	2308 KB	Output is correct
26	Correct	53 ms	2260 KB	Output is correct
27	Correct	36 ms	2260 KB	Output is correct
28	Correct	49 ms	2260 KB	Output is correct
29	Correct	51 ms	2260 KB	Output is correct
30	Correct	42 ms	2260 KB	Output is correct

Subtask #3
0 / 10.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	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	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	0 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	43 ms	2296 KB	Output is correct
17	Correct	46 ms	2296 KB	Output is correct
18	Correct	51 ms	2296 KB	Output is correct
19	Correct	35 ms	2260 KB	Output is correct
20	Correct	44 ms	2260 KB	Output is correct
21	Correct	46 ms	2260 KB	Output is correct
22	Correct	22 ms	1492 KB	Output is correct
23	Correct	10 ms	980 KB	Output is correct
24	Correct	44 ms	2260 KB	Output is correct
25	Correct	47 ms	2308 KB	Output is correct
26	Correct	53 ms	2260 KB	Output is correct
27	Correct	36 ms	2260 KB	Output is correct
28	Correct	49 ms	2260 KB	Output is correct
29	Correct	51 ms	2260 KB	Output is correct
30	Correct	42 ms	2260 KB	Output is correct
31	Execution timed out	1593 ms	70820 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 36.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	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	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	0 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	43 ms	2296 KB	Output is correct
17	Correct	46 ms	2296 KB	Output is correct
18	Correct	51 ms	2296 KB	Output is correct
19	Correct	35 ms	2260 KB	Output is correct
20	Correct	44 ms	2260 KB	Output is correct
21	Correct	46 ms	2260 KB	Output is correct
22	Correct	22 ms	1492 KB	Output is correct
23	Correct	10 ms	980 KB	Output is correct
24	Correct	44 ms	2260 KB	Output is correct
25	Correct	47 ms	2308 KB	Output is correct
26	Correct	53 ms	2260 KB	Output is correct
27	Correct	36 ms	2260 KB	Output is correct
28	Correct	49 ms	2260 KB	Output is correct
29	Correct	51 ms	2260 KB	Output is correct
30	Correct	42 ms	2260 KB	Output is correct
31	Execution timed out	1593 ms	70820 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.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	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	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	0 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	43 ms	2296 KB	Output is correct
17	Correct	46 ms	2296 KB	Output is correct
18	Correct	51 ms	2296 KB	Output is correct
19	Correct	35 ms	2260 KB	Output is correct
20	Correct	44 ms	2260 KB	Output is correct
21	Correct	46 ms	2260 KB	Output is correct
22	Correct	22 ms	1492 KB	Output is correct
23	Correct	10 ms	980 KB	Output is correct
24	Correct	44 ms	2260 KB	Output is correct
25	Correct	47 ms	2308 KB	Output is correct
26	Correct	53 ms	2260 KB	Output is correct
27	Correct	36 ms	2260 KB	Output is correct
28	Correct	49 ms	2260 KB	Output is correct
29	Correct	51 ms	2260 KB	Output is correct
30	Correct	42 ms	2260 KB	Output is correct
31	Execution timed out	1593 ms	70820 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #629023

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 0 / 10.0

Subtask #4 0 / 36.0

Subtask #5 0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0