oj.uz

Submission #131186

# Submission time Handle Problem Language Result Execution time Memory
131186 2019-07-16T18:32:28 Z youssefbou62 Hacker (BOI15_hac) C++14
100 / 100
 441 ms 14560 KB 
#include  <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long 
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll; 
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab  (int  x ) { return (x>0?x:-x); }

const int N = 500005 ;
int a[N] , pref[N],n,st[N*4]; 


void update(int uL , int uR , int i , int j , int u , int val ){
	// cout << i << " " << j <<endl; 
	if( i > j )return ; 
	if( i >= uL && j <= uR ){
		st[u] = min ( st[u] , val ) ; 
		return ; 
	}
	if( i > uR || j < uL )return ; 
	int l = u*2 + 1 , r = u*2+2 , mid = (i+j)/2 ; 
	update(uL,uR,i,mid,l,val) ; 
	update(uL,uR,mid+1,j,r,val) ;
}

int query (int i , int x , int y , int u){
	// cout << "querey"<<endl; 
	if( x > y )return 1e9; 
	if( x == y ){
		return st[u]; 
	}
	int l = u*2+1 , r = u*2+2 , mid = (x+y)/2 ;
	if( i <= mid )return min(st[u],query(i,x,mid,l)); 
	return min ( st[u] , query(i,mid+1,y,r)); 
}

int sum(int l , int r ){
	if( l > r )return 0; 
	if( l == 0 )return pref[r]; 
	return pref[r]-pref[l-1] ; 
}

int main(){
cin >> n ; 
for(int i = 0 ; i < 4*N ; i++ )st[i]=1e9; 
for(int i= 0 ;  i< n ; i++ )cin >> a[i] ; 
pref[0] = a[0] ; 
for(int i =  1 ; i < n ; i++ ){
	pref[i] = pref[i-1] + a[i] ; 
}
int ans = 0; 
for(int start = 0 ; start < n ; start ++ ){
	int end = min(n-1,start+(n/2)-!(n%2)); 
	int v0 = sum(start,end); 
	int res = (n/2+n%2) - (n-start) ; 
	int v1 = sum(0,res-1) ; 
	update(start,end,0,n-1,0,v1+v0)   ; 
	update(0,res-1,0,n-1,0,v1+v0)   ; 
}
for(int i = 0 ; i < n ; i++ ){
	ans = max ( ans , query(i,0,n-1,0)); 
}
cout << ans << endl ; 
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 12 ms 8184 KB Output is correct
4 Correct 72 ms 9080 KB Output is correct
5 Correct 162 ms 10488 KB Output is correct
6 Correct 212 ms 11240 KB Output is correct
7 Correct 257 ms 11800 KB Output is correct
8 Correct 428 ms 13944 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Correct 9 ms 8184 KB Output is correct
3 Correct 8 ms 8184 KB Output is correct
4 Correct 9 ms 8184 KB Output is correct
5 Correct 10 ms 8184 KB Output is correct
6 Correct 9 ms 8184 KB Output is correct
7 Correct 9 ms 8184 KB Output is correct
8 Correct 9 ms 8184 KB Output is correct
9 Correct 9 ms 8184 KB Output is correct
10 Correct 9 ms 8184 KB Output is correct
11 Correct 9 ms 8184 KB Output is correct
12 Correct 11 ms 8184 KB Output is correct
13 Correct 9 ms 8184 KB Output is correct
14 Correct 9 ms 8184 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 9 ms 8184 KB Output is correct
17 Correct 9 ms 8184 KB Output is correct
18 Correct 9 ms 8184 KB Output is correct
19 Correct 9 ms 8184 KB Output is correct
20 Correct 9 ms 8184 KB Output is correct
21 Correct 9 ms 8184 KB Output is correct
22 Correct 11 ms 8184 KB Output is correct
23 Correct 12 ms 8184 KB Output is correct
24 Correct 10 ms 8184 KB Output is correct
25 Correct 14 ms 8184 KB Output is correct
26 Correct 12 ms 8184 KB Output is correct
27 Correct 8 ms 8184 KB Output is correct
28 Correct 9 ms 8184 KB Output is correct
29 Correct 10 ms 8188 KB Output is correct
30 Correct 12 ms 8184 KB Output is correct
31 Correct 12 ms 8184 KB Output is correct
32 Correct 9 ms 8184 KB Output is correct
33 Correct 9 ms 8184 KB Output is correct
34 Correct 12 ms 8184 KB Output is correct
35 Correct 72 ms 9080 KB Output is correct
36 Correct 162 ms 10488 KB Output is correct
37 Correct 212 ms 11240 KB Output is correct
38 Correct 257 ms 11800 KB Output is correct
39 Correct 428 ms 13944 KB Output is correct
40 Correct 16 ms 8312 KB Output is correct
41 Correct 23 ms 8440 KB Output is correct
42 Correct 32 ms 8568 KB Output is correct
43 Correct 169 ms 10616 KB Output is correct
44 Correct 419 ms 14300 KB Output is correct
45 Correct 80 ms 9208 KB Output is correct
46 Correct 251 ms 11768 KB Output is correct
47 Correct 420 ms 14336 KB Output is correct
48 Correct 441 ms 14560 KB Output is correct
49 Correct 387 ms 13716 KB Output is correct
50 Correct 390 ms 13688 KB Output is correct