oj.uz

Submission #247703

# Submission time Handle Problem Language Result Execution time Memory
247703 2020-07-12T03:01:23 Z MohamedAhmed04 Hacker (BOI15_hac) C++14
100 / 100
 405 ms 18424 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 5e5 + 10 ;

int arr[MAX] , pref[MAX] ;
int n ;
int sz ;

int sum(int idx)
{
	int a = min(n-1 , idx+sz-1) ;
	int x = pref[a] ;
	if(idx > 0)
		x -= pref[idx-1] ;
	if(idx + sz-1 >= n)
		x += pref[idx + sz-1 - n] ;
	return x ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 0 ; i < n ; ++i)
		cin>>arr[i] ;
	pref[0] = arr[0] ;
	for(int i = 1 ; i < n ; ++i)
		pref[i] = pref[i-1] + arr[i] ;
	multiset<int>s ;
	sz = (n+1) / 2 ;
	int ans = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		if(i+sz-1 >= n)
			s.insert(sum(i)) ;
	}
	for(int i = 0 ; i < n ; ++i)
	{
		s.insert(sum(i)) ;
		ans = max(ans , *s.begin()) ;
		s.erase(s.find(sum((i-sz+1 + n) % n))) ;
	}
	return cout<<ans<<"\n" , 0 ;
}

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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 2 ms 512 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 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct

Subtask #3
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 3 ms 512 KB Output is correct
4 Correct 40 ms 3200 KB Output is correct
5 Correct 114 ms 7432 KB Output is correct
6 Correct 170 ms 9208 KB Output is correct
7 Correct 190 ms 11128 KB Output is correct
8 Correct 405 ms 18168 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 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 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 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 3 ms 512 KB Output is correct
26 Correct 2 ms 512 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 2 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 40 ms 3200 KB Output is correct
36 Correct 114 ms 7432 KB Output is correct
37 Correct 170 ms 9208 KB Output is correct
38 Correct 190 ms 11128 KB Output is correct
39 Correct 405 ms 18168 KB Output is correct
40 Correct 5 ms 768 KB Output is correct
41 Correct 10 ms 1032 KB Output is correct
42 Correct 14 ms 1408 KB Output is correct
43 Correct 117 ms 7420 KB Output is correct
44 Correct 335 ms 18296 KB Output is correct
45 Correct 53 ms 3960 KB Output is correct
46 Correct 171 ms 11000 KB Output is correct
47 Correct 384 ms 18168 KB Output is correct
48 Correct 247 ms 18424 KB Output is correct
49 Correct 227 ms 17528 KB Output is correct
50 Correct 251 ms 17528 KB Output is correct