Submission #888266

# Submission time Handle Problem Language Result Execution time Memory
888266 2023-12-16T18:03:05 Z beaboss Hacker (BOI15_hac) C++14
100 / 100
232 ms 18512 KB
// Source: https://oj.uz/problem/view/BOI15_hac
// 

#include "bits/stdc++.h"

using namespace std;

#define s second
#define f first
#define pb push_back

typedef long long ll;

typedef pair<int, int> pii;
typedef vector<pii> vpii;

typedef vector<int> vi;

#define FOR(i, a, b) for (int i = (a); i<b; i++)

bool ckmin(int& a, int b){ return b < a ? a = b, true : false; }

bool ckmax(int& a, int b){ return b > a ? a = b, true : false; }

const int N = 5e5 + 10;
int a[N];
int res[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;

	FOR(i, 0, n) cin >> a[i];

	int sum = 0;

	FOR(i, 0, (n+1)/2) sum += a[i];

	int i = 0;
	int j = (n+1)/2;

	for (;i < n;) {
		res[i] = sum;
		sum += a[j]-a[i];
		i++;
		j = (j + 1) % n;
	}

	multiset<int> window;

	FOR(i, 0, (n + 1) / 2) window.insert(res[i]);

	int ans = 0;

	i = 0;
	j = (n+1)/2;

	for (;i < n;) {
		ans = max(ans, *window.begin());
		window.erase(window.find(res[i]));
		window.insert(res[j]);

		i++;
		j = (j + 1) % n;
	}
	cout << ans << endl;

}












# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2512 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2512 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2648 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 0 ms 2396 KB Output is correct
30 Correct 2 ms 2536 KB Output is correct
31 Correct 2 ms 2648 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2648 KB Output is correct
4 Correct 28 ms 5116 KB Output is correct
5 Correct 72 ms 8528 KB Output is correct
6 Correct 93 ms 10324 KB Output is correct
7 Correct 106 ms 11856 KB Output is correct
8 Correct 232 ms 18064 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2512 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 2 ms 2648 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 0 ms 2396 KB Output is correct
30 Correct 2 ms 2536 KB Output is correct
31 Correct 2 ms 2648 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 28 ms 5116 KB Output is correct
36 Correct 72 ms 8528 KB Output is correct
37 Correct 93 ms 10324 KB Output is correct
38 Correct 106 ms 11856 KB Output is correct
39 Correct 232 ms 18064 KB Output is correct
40 Correct 3 ms 2652 KB Output is correct
41 Correct 6 ms 2908 KB Output is correct
42 Correct 9 ms 3404 KB Output is correct
43 Correct 72 ms 8528 KB Output is correct
44 Correct 198 ms 18264 KB Output is correct
45 Correct 34 ms 5468 KB Output is correct
46 Correct 105 ms 11860 KB Output is correct
47 Correct 209 ms 18260 KB Output is correct
48 Correct 169 ms 18512 KB Output is correct
49 Correct 152 ms 17604 KB Output is correct
50 Correct 157 ms 17672 KB Output is correct