oj.uz

Submission #535462

# Submission time Handle Problem Language Result Execution time Memory
535462 2022-03-10T09:58:39 Z new_acc Hacker (BOI15_hac) C++14
100 / 100
 143 ms 15564 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=5e5+10;
int sp[N],k[N],naj[N];
int t[N],p[N*2];
void solve(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>t[i];
	for(int i=1;i<=n;i++) sp[i]=sp[i-1]+t[i];
	for(int i=1;i<=n;i++){
		int dl=(n+1)/2;
		if(i>=dl) k[i]=sp[i]-sp[i-dl];
		else k[i]=sp[i]+sp[n]-sp[n-dl+i];
	}
	deque<pair<int,int> >deq;
	for(int i=n*2;i>=1;i--) p[i]=(i>n?k[i-n]:k[i]);
	for(int i=n*2;i>=1;i--){
		while(deq.size() and deq.back().fi>=p[i]) deq.pop_back();
		if(deq.size() and deq.front().se==i+(n+1)/2) deq.pop_front();
		deq.push_back({p[i],i});
		if(i<=n) naj[i]=deq.front().fi;
	}
	int res=0;
	for(int i=1;i<=n;i++) res=max(res,naj[i]);
	cout<<res<<"\n";
}
int main(){
	solve();
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 29 ms 2508 KB Output is correct
5 Correct 54 ms 5724 KB Output is correct
6 Correct 69 ms 7188 KB Output is correct
7 Correct 83 ms 8720 KB Output is correct
8 Correct 143 ms 14140 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 3 ms 468 KB Output is correct
26 Correct 2 ms 452 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 476 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 29 ms 2508 KB Output is correct
36 Correct 54 ms 5724 KB Output is correct
37 Correct 69 ms 7188 KB Output is correct
38 Correct 83 ms 8720 KB Output is correct
39 Correct 143 ms 14140 KB Output is correct
40 Correct 3 ms 596 KB Output is correct
41 Correct 6 ms 852 KB Output is correct
42 Correct 9 ms 1168 KB Output is correct
43 Correct 55 ms 5772 KB Output is correct
44 Correct 142 ms 14144 KB Output is correct
45 Correct 29 ms 2960 KB Output is correct
46 Correct 89 ms 8580 KB Output is correct
47 Correct 137 ms 14196 KB Output is correct
48 Correct 130 ms 14416 KB Output is correct
49 Correct 120 ms 15560 KB Output is correct
50 Correct 125 ms 15564 KB Output is correct