oj.uz

Submission #723671

# Submission time Handle Problem Language Result Execution time Memory
723671 2023-04-14T07:24:19 Z MurotY Hacker (BOI15_hac) C++14
40 / 100
 1000 ms 1592 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define sz size()
using namespace std;
const double pi = 2 * acos(0.0);
const ll N=1e6+7, M=998244353;

ll a[N], pr[N];
void solve()
{
	int n;
	cin >> n;
	for (int i=0;i<n;i++) {
	     cin >> a[i];
		pr[i]=pr[max(0, i-1)]+a[i];
	}
	ll ans=0;
	for (int i=0;i<n;i++){
		int res=(n+1)/2;
		ll mn=1e18;
		for (int j=0;j<res;j++){
			
			int l=(i-1+n) % n, r=i;
			ll sum=0;
			int lf;
			if ((l-j+1) >= 0 && j > 0){
				lf=l-j+1;
				if (lf == 0) sum+=pr[l];
				else sum+=pr[l]-pr[lf-1];
			}
			else if (j > 0){
				sum+=pr[l];
				lf=(l-j+1+n) % n;
				if (lf == 0) sum+=pr[n-1];
				else sum+=pr[n-1]-pr[lf-1];
			}
			int j1=res-j; l=i;
		//	if (i == 0) cout << j <<" " << j1 << "\n";
			if ((l+j1-1) < n && j1 > 0){
				lf=l+j1-1;
				if (r == 0) sum+=pr[lf];
				else sum+=pr[lf]-pr[r-1];
			}
			else if (j1 > 0){
				if (r == 0) sum+=pr[n-1];
				else sum+=pr[n-1]-pr[r-1];
				lf=(i+j1-1) % n;
				sum+=pr[lf];
			}	
		//	cout << sum << "\n"; 
			mn=min(mn, sum);
		}
		ans=max(ans, mn);
	}
	cout << ans;
	return ;
}
int main(){
	ios;
	int t=1;	
//	cin >> t;
	while (t--){ 
	    solve();
	    cout << "\n";
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 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 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 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 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 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 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 19 ms 376 KB Output is correct
23 Correct 49 ms 340 KB Output is correct
24 Correct 16 ms 384 KB Output is correct
25 Correct 45 ms 340 KB Output is correct
26 Correct 44 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 51 ms 340 KB Output is correct
31 Correct 46 ms 340 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 44 ms 340 KB Output is correct
4 Execution timed out 1092 ms 1592 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 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 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 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 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 19 ms 376 KB Output is correct
23 Correct 49 ms 340 KB Output is correct
24 Correct 16 ms 384 KB Output is correct
25 Correct 45 ms 340 KB Output is correct
26 Correct 44 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 51 ms 340 KB Output is correct
31 Correct 46 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 44 ms 340 KB Output is correct
35 Execution timed out 1092 ms 1592 KB Time limit exceeded
36 Halted 0 ms 0 KB -