oj.uz

Submission #953077

# Submission time Handle Problem Language Result Execution time Memory
953077 2024-03-25T12:11:49 Z PM1 Hacker (BOI15_hac) C++17
100 / 100
 169 ms 12884 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxn=5e5+5;
int n,a[mxn],b[mxn],ans=1e9,num=0;
struct segment{
	int val[(1<<22)];
	void build(int id,int L,int R){
		if(L+1==R){
			val[id]=b[L];
			return;
		}
		int mid=(L+R)/2;
		build(id*2,L,mid);
		build(id*2+1,mid,R);
		val[id]=max(val[id*2],val[id*2+1]);
	}
	int get(int id,int L,int R,int l,int r){
		if(l==L && R==r)
			return val[id];
		int mid=(L+R)/2,res=0;
		if(l<mid)
			res=max(res,get(id*2,L,mid,l,min(r,mid)) );
		if(r>mid)
			res=max(res,get(id*2+1,mid,R,max(l,mid),r) );
		return res;
	}
}seg;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i];
		num+=a[i];
	}
	int sum=0;
	for(int i=0;i<n/2;i++)
		sum+=a[i];
	for(int i=0;i<n;i++){
		b[i]=sum;
		sum-=a[i];
		sum+=a[(i+n/2)%n];
		//cout<<b[i]<<" ";
	}
	seg.build(1,0,n);
	for(int i=0;i<n;i++){
		int l=(i+1)%n,r=(i-n/2+n)%n,res=0;
		//cout<<l<<" "<<r<<endl;
		if(l<=r)
			res=seg.get(1,0,n,l,r+1);
		else
			res=max(seg.get(1,0,n,l,n),seg.get(1,0,n,0,r+1));
		ans=min(ans,res);
	}
	cout<<num-ans<<endl;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4544 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4544 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 2 ms 4456 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 2 ms 4452 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 1 ms 4456 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4456 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 2 ms 4448 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4456 KB Output is correct
2 Correct 1 ms 4452 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 26 ms 6976 KB Output is correct
5 Correct 61 ms 8032 KB Output is correct
6 Correct 81 ms 8544 KB Output is correct
7 Correct 99 ms 10848 KB Output is correct
8 Correct 161 ms 12580 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 2 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Correct 1 ms 4544 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 2 ms 4456 KB Output is correct
23 Correct 2 ms 4444 KB Output is correct
24 Correct 2 ms 4452 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 2 ms 4440 KB Output is correct
27 Correct 1 ms 4456 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4456 KB Output is correct
30 Correct 3 ms 4444 KB Output is correct
31 Correct 2 ms 4448 KB Output is correct
32 Correct 1 ms 4456 KB Output is correct
33 Correct 1 ms 4452 KB Output is correct
34 Correct 2 ms 4444 KB Output is correct
35 Correct 26 ms 6976 KB Output is correct
36 Correct 61 ms 8032 KB Output is correct
37 Correct 81 ms 8544 KB Output is correct
38 Correct 99 ms 10848 KB Output is correct
39 Correct 161 ms 12580 KB Output is correct
40 Correct 4 ms 4696 KB Output is correct
41 Correct 7 ms 6748 KB Output is correct
42 Correct 10 ms 6740 KB Output is correct
43 Correct 64 ms 8140 KB Output is correct
44 Correct 163 ms 12656 KB Output is correct
45 Correct 30 ms 7212 KB Output is correct
46 Correct 97 ms 10832 KB Output is correct
47 Correct 163 ms 12488 KB Output is correct
48 Correct 169 ms 12884 KB Output is correct
49 Correct 147 ms 11924 KB Output is correct
50 Correct 148 ms 11812 KB Output is correct