Submission #516241

# Submission time Handle Problem Language Result Execution time Memory
516241 2022-01-20T18:50:14 Z sidon Hacker (BOI15_hac) C++17
100 / 100
53 ms 8588 KB
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	int N; cin >> N;
	int a[N] = {}, b[2*N], pref = 0;
	int x = (N + 1) / 2;

	for(int &i : a) cin >> i;

	for(int i = 0; i - x < N; i++) {
		if(i && i < N) a[i] += a[i-1];
		pref = a[i % N];
		if(i >= N) pref += a[N - 1];
		if(i >= x)
			b[i-x+N] = b[i-x] = pref - a[i-x];
	}

	int *l = a, *r = a, res = 0;

	for(int i = 0; i < 2*N; i++) {
		while(l != r && b[*(r-1)] >= b[i]) --r;
		(*r++) = i;
		while(*l <= i-x) ++l;

		if(i >= x-1) res = max(res, b[*l]);
	}

	cout << res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 236 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 236 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 8 ms 1484 KB Output is correct
5 Correct 25 ms 3412 KB Output is correct
6 Correct 25 ms 4320 KB Output is correct
7 Correct 30 ms 5168 KB Output is correct
8 Correct 53 ms 8328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 236 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 308 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 8 ms 1484 KB Output is correct
36 Correct 25 ms 3412 KB Output is correct
37 Correct 25 ms 4320 KB Output is correct
38 Correct 30 ms 5168 KB Output is correct
39 Correct 53 ms 8328 KB Output is correct
40 Correct 2 ms 456 KB Output is correct
41 Correct 2 ms 588 KB Output is correct
42 Correct 4 ms 708 KB Output is correct
43 Correct 20 ms 3532 KB Output is correct
44 Correct 49 ms 8340 KB Output is correct
45 Correct 14 ms 1740 KB Output is correct
46 Correct 31 ms 5080 KB Output is correct
47 Correct 49 ms 8340 KB Output is correct
48 Correct 39 ms 8588 KB Output is correct
49 Correct 36 ms 7700 KB Output is correct
50 Correct 36 ms 7680 KB Output is correct