oj.uz

Submission #676498

# Submission time Handle Problem Language Result Execution time Memory
676498 2022-12-31T03:48:37 Z penguin133 Hacker (BOI15_hac) C++17
100 / 100
 59 ms 20404 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[1000005], B[1000005], P[1000005], S[500005];
deque<int>dq;
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int n;cin >> n;
	for(int i=1;i<=n;i++)cin >> B[i];
	for(int i=n+1;i<=n*2;i++)B[i] = B[i-n];
	for(int i=1;i<=2*n;i++)P[i] = P[i-1] + B[i];
	int x = n / 2;
	for(int i=1;i<=n-x;i++){
		while(!dq.empty() && P[dq.back() + x-1] - P[dq.back()-1] < P[i+x-1] - P[i-1])dq.pop_back();
		dq.push_back(i);
	}
	int maxi = 1e9;
	for(int i=1;i<=n;i++){
		while(!dq.empty() && P[dq.back() + x-1] - P[dq.back()-1] < P[n+i-1] - P[n+i-x-1])dq.pop_back();
		if(!dq.empty() && dq.front() == i)dq.pop_front();
		dq.push_back(n+i-x);
		maxi = min(maxi, P[dq[0] + x - 1] - P[dq[0] - 1]);
	}
	cout << P[n] - maxi;
}

Compilation message

hac.cpp:6:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    6 | main(){
      | ^~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 0 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 324 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 0 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 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 328 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 9 ms 3156 KB Output is correct
5 Correct 22 ms 7328 KB Output is correct
6 Correct 26 ms 9164 KB Output is correct
7 Correct 31 ms 11044 KB Output is correct
8 Correct 52 ms 18168 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 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 0 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 9 ms 3156 KB Output is correct
36 Correct 22 ms 7328 KB Output is correct
37 Correct 26 ms 9164 KB Output is correct
38 Correct 31 ms 11044 KB Output is correct
39 Correct 52 ms 18168 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 2 ms 980 KB Output is correct
42 Correct 4 ms 1364 KB Output is correct
43 Correct 27 ms 7480 KB Output is correct
44 Correct 59 ms 18188 KB Output is correct
45 Correct 11 ms 3812 KB Output is correct
46 Correct 33 ms 10952 KB Output is correct
47 Correct 55 ms 18076 KB Output is correct
48 Correct 46 ms 20404 KB Output is correct
49 Correct 45 ms 19532 KB Output is correct
50 Correct 40 ms 19580 KB Output is correct