oj.uz

Submission #864284

# Submission time Handle Problem Language Result Execution time Memory
864284 2023-10-22T10:13:51 Z serifefedartar Cigle (COI21_cigle) C++17
48 / 100
 81 ms 72096 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll LOGN = 20; 
const ll MAXN = 3005;

vector<int> A;
int dp[MAXN][MAXN];

int main() {
	fast
	int N;
	cin >> N;

	A = vector<int>(N);
	for (int i = 0; i < N; i++)
		cin >> A[i];

	for (int l = 0; l <= N; l++) {
		for (int l2 = 1; l2 < l; l2++)
			dp[l2][l] = max(dp[l2][l], dp[l2-1][l]);

		int bal = 0, match = 0, curr = 0, left_border = l;
		for (int r = l+1; r <= N; r++) {
			bal += A[r-1];
			while (left_border > 0 && bal - A[left_border - 1] >= 0) {
				bal -= A[left_border - 1];
				left_border--;
			}

			dp[l][r] = max(dp[l][r-1], curr);

			if (bal == 0) {
				match++;
				if (left_border) 
					curr = max(curr, dp[left_border - 1][l] + match);
			}
		}
	}
	cout << dp[N-1][N] << "\n";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 728 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2908 KB Output is correct
4 Correct 2 ms 2908 KB Output is correct
5 Correct 2 ms 2908 KB Output is correct
6 Correct 2 ms 3160 KB Output is correct
7 Correct 3 ms 2908 KB Output is correct
8 Correct 2 ms 2904 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 3 ms 2908 KB Output is correct
11 Correct 2 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 728 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 2 ms 3160 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 2 ms 2904 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 3 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2904 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 2 ms 2908 KB Output is correct
36 Correct 2 ms 2960 KB Output is correct
37 Correct 2 ms 2908 KB Output is correct
38 Correct 3 ms 2904 KB Output is correct
39 Correct 3 ms 2908 KB Output is correct
40 Correct 2 ms 2908 KB Output is correct
41 Correct 2 ms 2768 KB Output is correct
42 Correct 2 ms 2908 KB Output is correct
43 Correct 2 ms 2908 KB Output is correct
44 Correct 2 ms 2908 KB Output is correct
45 Correct 3 ms 2908 KB Output is correct
46 Correct 2 ms 2908 KB Output is correct
47 Correct 2 ms 2768 KB Output is correct
48 Correct 2 ms 3160 KB Output is correct
49 Correct 2 ms 2908 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 728 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 2 ms 2908 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 2 ms 2908 KB Output is correct
24 Correct 2 ms 2908 KB Output is correct
25 Correct 2 ms 2908 KB Output is correct
26 Correct 2 ms 3160 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 2 ms 2904 KB Output is correct
29 Correct 2 ms 2908 KB Output is correct
30 Correct 3 ms 2908 KB Output is correct
31 Correct 2 ms 2908 KB Output is correct
32 Correct 2 ms 2908 KB Output is correct
33 Correct 2 ms 2904 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 2 ms 2908 KB Output is correct
36 Correct 2 ms 2960 KB Output is correct
37 Correct 2 ms 2908 KB Output is correct
38 Correct 3 ms 2904 KB Output is correct
39 Correct 3 ms 2908 KB Output is correct
40 Correct 2 ms 2908 KB Output is correct
41 Correct 2 ms 2768 KB Output is correct
42 Correct 2 ms 2908 KB Output is correct
43 Correct 2 ms 2908 KB Output is correct
44 Correct 2 ms 2908 KB Output is correct
45 Correct 3 ms 2908 KB Output is correct
46 Correct 2 ms 2908 KB Output is correct
47 Correct 2 ms 2768 KB Output is correct
48 Correct 2 ms 3160 KB Output is correct
49 Correct 2 ms 2908 KB Output is correct
50 Runtime error 81 ms 72096 KB Execution killed with signal 11
51 Halted 0 ms 0 KB -