oj.uz

Submission #252465

# Submission time Handle Problem Language Result Execution time Memory
252465 2020-07-25T15:55:04 Z Blagojce Hacker (BOI15_hac) C++11
100 / 100
 119 ms 22888 KB 
#include <bits/stdc++.h> 
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)
#include <time.h>
#include <cmath>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;

const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1000000007;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;
 
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 5e5;


void solve(){
	int n;
	cin >> n;
	int a[2*n];
	fr(i, 0, n){
		cin >> a[i];
		a[i+n] = a[i];
	}
	int len = (n+1)/2;
	
	n*=2;
	int pre[n];
	pre[0] = a[0];
	fr(i, 1, n){
		pre[i] = pre[i-1]+a[i];
	}
	int sum[n];
	memset(sum, 0, sizeof(sum));
	fr(i, len-1, n){
		int s = pre[i];
		if(i-len >= 0) s -= pre[i-len];
		sum[i-len+1] = s;
		
	}
	int ans = 0;
	pq<pii> Q;
	
	fr(i, 0, n){
		Q.push({-sum[i], i});
		while(!Q.empty() && Q.top().nd <= i-len) Q.pop();
		if(i >= len-1) ans = max(ans, -	Q.top().st);
	}
	cout<<ans<<endl;
}
int main(){

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	solve();
	
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 19 ms 3708 KB Output is correct
5 Correct 58 ms 10092 KB Output is correct
6 Correct 73 ms 11784 KB Output is correct
7 Correct 60 ms 13036 KB Output is correct
8 Correct 98 ms 22576 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 400 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 396 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 640 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 640 KB Output is correct
31 Correct 2 ms 640 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 2 ms 640 KB Output is correct
35 Correct 19 ms 3708 KB Output is correct
36 Correct 58 ms 10092 KB Output is correct
37 Correct 73 ms 11784 KB Output is correct
38 Correct 60 ms 13036 KB Output is correct
39 Correct 98 ms 22576 KB Output is correct
40 Correct 2 ms 896 KB Output is correct
41 Correct 4 ms 1536 KB Output is correct
42 Correct 7 ms 1792 KB Output is correct
43 Correct 40 ms 10220 KB Output is correct
44 Correct 119 ms 22632 KB Output is correct
45 Correct 20 ms 5240 KB Output is correct
46 Correct 70 ms 12984 KB Output is correct
47 Correct 103 ms 22624 KB Output is correct
48 Correct 102 ms 22888 KB Output is correct
49 Correct 91 ms 22116 KB Output is correct
50 Correct 85 ms 21992 KB Output is correct