oj.uz

Submission #491447

# Submission time Handle Problem Language Result Execution time Memory
491447 2021-12-02T09:59:11 Z Rainbowbunny Hacker (BOI15_hac) C++17
100 / 100
 62 ms 21644 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5e5 + 5;

int n;
long long pref[3 * MAXN], A[MAXN];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> A[i];
        pref[i] = pref[i - 1] + A[i];
    }
    int hh = (n + 1) / 2;
    for(int i = n + 1; i <= 2 * n; i++)
    {
        pref[i] = pref[i - 1] + A[i - n];
    }
    for(int i = 2 * n + 1; i <= 3 * n; i++)
    {
        pref[i] = pref[i - 1] + A[i - 2 * n];
    }
    long long ans = 0;
    deque <pair <long long, int> > Pos;
    for(int i = 1; i <= 2 * n; i++)
    {
        while(!Pos.empty() and Pos.front().second < i - hh + 1)
        {
            Pos.pop_front();
        }
        while(!Pos.empty() and Pos.back().first >= pref[i + hh - 1] - pref[i - 1])
        {
            Pos.pop_back();
        }
        Pos.push_back(make_pair(pref[i + hh - 1] - pref[i - 1], i));
        if(i >= hh)
        {
            ans = max(ans, Pos.front().first);
        }
    }
    cout << ans << '\n';
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 9 ms 3188 KB Output is correct
5 Correct 20 ms 7332 KB Output is correct
6 Correct 31 ms 9156 KB Output is correct
7 Correct 33 ms 11008 KB Output is correct
8 Correct 62 ms 18136 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 0 ms 316 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 460 KB Output is correct
35 Correct 9 ms 3188 KB Output is correct
36 Correct 20 ms 7332 KB Output is correct
37 Correct 31 ms 9156 KB Output is correct
38 Correct 33 ms 11008 KB Output is correct
39 Correct 62 ms 18136 KB Output is correct
40 Correct 2 ms 588 KB Output is correct
41 Correct 3 ms 972 KB Output is correct
42 Correct 4 ms 1356 KB Output is correct
43 Correct 22 ms 7372 KB Output is correct
44 Correct 56 ms 18052 KB Output is correct
45 Correct 11 ms 3708 KB Output is correct
46 Correct 32 ms 10948 KB Output is correct
47 Correct 55 ms 18216 KB Output is correct
48 Correct 45 ms 18372 KB Output is correct
49 Correct 44 ms 21644 KB Output is correct
50 Correct 50 ms 21612 KB Output is correct