Submission #634050

# Submission time Handle Problem Language Result Execution time Memory
634050 2022-08-23T18:06:13 Z izanbf Hacker (BOI15_hac) C++14
100 / 100
374 ms 18428 KB
#include <bits/stdc++.h>
using namespace std;

#define D(x) cerr << #x << " = " << x << ", "

using vi = vector<int>;
using vvi = vector<vi>;

vi compute_ksums(const vi& a, int k) {
	int n = a.size();
	vi v(2*n);
	for (int i = 0; i < n; ++i) {
		v[i] = v[n+i] = a[i];
	}
	vi pre(2*n+1); // pre[i+1] = v[0]+...+v[i]
	for (int i = 0; i < 2*n; ++i) {
		pre[i+1] = pre[i] + v[i];
	}
	vi ksums(n); // ksums[i] = v[i] + ... + v[i+k-1]
	for (int i = 0; i < n; ++i) {
		ksums[i] = pre[i+k] - pre[i];
	}
	return ksums;
}

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

	int n;
	cin >> n;

	int k = n/2; // range of the deffender

	int sum = 0;
	vi v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
		sum += v[i];
	}

	vi ksums = compute_ksums(v, k);
	multiset<int> s;
	int l = 1;
	int r = n-k;
	int ans = 0;
	for (int i = l; i <= r; ++i) {
		s.insert(-ksums[i]);
	} 
	for (int i = 0; i < n; ++i) {
		int best = -(*s.begin());
		ans = max(ans, sum-best);
		r = (r+1)%n;
		s.insert(-ksums[r]);
		s.erase(s.find(-ksums[l]));
		l = (l+1)%n;
	}

	/*int ans = 0;
	for (int i = 0; i < n; ++i) {
		int best = 0;
		for (int j = 0; j < n; ++j) {
			int l = j;
			int r = j+k-1;
			if ((i < l or i > r) and (n+i < l or n+i > r)) {
				best = max(best, ksums[j]);
			}
		}
		ans = max(ans, sum-best);
	}*/

	cout << ans << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 500 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 30 ms 3180 KB Output is correct
5 Correct 104 ms 7256 KB Output is correct
6 Correct 159 ms 9268 KB Output is correct
7 Correct 136 ms 11080 KB Output is correct
8 Correct 374 ms 18148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 500 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 2 ms 464 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 2 ms 464 KB Output is correct
35 Correct 30 ms 3180 KB Output is correct
36 Correct 104 ms 7256 KB Output is correct
37 Correct 159 ms 9268 KB Output is correct
38 Correct 136 ms 11080 KB Output is correct
39 Correct 374 ms 18148 KB Output is correct
40 Correct 4 ms 596 KB Output is correct
41 Correct 10 ms 916 KB Output is correct
42 Correct 12 ms 1408 KB Output is correct
43 Correct 90 ms 7460 KB Output is correct
44 Correct 281 ms 18152 KB Output is correct
45 Correct 39 ms 3764 KB Output is correct
46 Correct 186 ms 11016 KB Output is correct
47 Correct 308 ms 18216 KB Output is correct
48 Correct 237 ms 18428 KB Output is correct
49 Correct 223 ms 17560 KB Output is correct
50 Correct 212 ms 17528 KB Output is correct