Submission #652371

# Submission time Handle Problem Language Result Execution time Memory
652371 2022-10-22T10:17:00 Z beaconmc Hacker (BOI15_hac) C++14
100 / 100
523 ms 30140 KB
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)

ll n;
vector<ll> sussies;
vector<ll> realsus;
multiset<ll> imp;
ll ans = -1;

int main(){
	cin >> n;
	FOR(i,0,n){
		ll temp;
		cin >> temp;
		sussies.push_back(temp);
	}
	FOR(i,0,n){
		sussies.push_back(sussies[i]);
	}

	ll k = (n+1)/2;
	ll cur = 0;
	FOR(i,0,k) cur += sussies[i];
	realsus.push_back(cur);

	FOR(i,1,n){
		cur -= sussies[i-1];
		cur += sussies[i+k-1];
		realsus.push_back(cur);
	}
	

	ll temp = realsus.size();

	FOR(i,0,temp) realsus.push_back(realsus[i]);

	FOR(i,0,k) imp.insert(realsus[i]);



	ans = max(ans, *imp.begin());
	
	FOR(i,1,n){
		imp.erase(imp.find(realsus[i-1]));
		imp.insert(realsus[i+k-1]);
		ans = max(ans, *imp.begin());
	}

	cout << ans << endl;



}
# 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 0 ms 212 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 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 0 ms 212 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 3 ms 592 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 3 ms 596 KB Output is correct
4 Correct 44 ms 4680 KB Output is correct
5 Correct 130 ms 11984 KB Output is correct
6 Correct 167 ms 15148 KB Output is correct
7 Correct 193 ms 18584 KB Output is correct
8 Correct 523 ms 29996 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 0 ms 212 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 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 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 468 KB Output is correct
23 Correct 3 ms 468 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 592 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 3 ms 592 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 3 ms 596 KB Output is correct
35 Correct 44 ms 4680 KB Output is correct
36 Correct 130 ms 11984 KB Output is correct
37 Correct 167 ms 15148 KB Output is correct
38 Correct 193 ms 18584 KB Output is correct
39 Correct 523 ms 29996 KB Output is correct
40 Correct 5 ms 852 KB Output is correct
41 Correct 14 ms 1400 KB Output is correct
42 Correct 18 ms 1992 KB Output is correct
43 Correct 164 ms 12140 KB Output is correct
44 Correct 417 ms 29852 KB Output is correct
45 Correct 58 ms 6112 KB Output is correct
46 Correct 253 ms 18500 KB Output is correct
47 Correct 484 ms 30092 KB Output is correct
48 Correct 345 ms 30140 KB Output is correct
49 Correct 277 ms 29244 KB Output is correct
50 Correct 278 ms 29276 KB Output is correct