oj.uz

Submission #1110870

# Submission time Handle Problem Language Result Execution time Memory
1110870 2024-11-10T17:44:30 Z Rainmaker2627 Hacker (BOI15_hac) C++17
100 / 100
 48 ms 8776 KB 
#include<bits/stdc++.h>
using namespace std;

struct maxqueue {
	queue<int> q;
	deque<int> dq;

	void pop() {
		int v=q.front();
		if (v==dq.front()) dq.pop_front();
		q.pop();
	}

	void push(int v) {
		q.push(v);
		while (!dq.empty() && dq.back()<v) dq.pop_back();
		dq.push_back(v);
	}

	int query() {
		return dq.front();
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(false);

	int n, c=0, t=0;
	cin >> n;
	vector<int> v(n), s(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
		if (i<n/2) c+=v[i];
		t+=v[i];
	}

	maxqueue mq;
	for (int i = 0; i < n; ++i) {
		s[i]=c;
		if (i>0 && i<(n+1)/2+1) mq.push(s[i]);
		c+=v[(i+n/2)%n]-v[i];
	}

	int m=0;
	for (int i = 0; i < n; ++i) {
		m=max(m, t-mq.query());
		mq.pop();
		mq.push(s[(i+(n+1)/2+1)%n]);
	} cout << m << '\n';

	return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 8 ms 1360 KB Output is correct
5 Correct 16 ms 3152 KB Output is correct
6 Correct 20 ms 3920 KB Output is correct
7 Correct 25 ms 4680 KB Output is correct
8 Correct 39 ms 7500 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 504 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 504 KB Output is correct
27 Correct 1 ms 504 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 8 ms 1360 KB Output is correct
36 Correct 16 ms 3152 KB Output is correct
37 Correct 20 ms 3920 KB Output is correct
38 Correct 25 ms 4680 KB Output is correct
39 Correct 39 ms 7500 KB Output is correct
40 Correct 1 ms 592 KB Output is correct
41 Correct 2 ms 696 KB Output is correct
42 Correct 3 ms 848 KB Output is correct
43 Correct 16 ms 3336 KB Output is correct
44 Correct 48 ms 7504 KB Output is correct
45 Correct 9 ms 1616 KB Output is correct
46 Correct 26 ms 4580 KB Output is correct
47 Correct 45 ms 7496 KB Output is correct
48 Correct 34 ms 8776 KB Output is correct
49 Correct 33 ms 8008 KB Output is correct
50 Correct 33 ms 7820 KB Output is correct