oj.uz

Submission #310194

# Submission time Handle Problem Language Result Execution time Memory
310194 2020-10-06T07:47:44 Z nicolaalexandra Hacker (BOI15_hac) C++14
100 / 100
 262 ms 11812 KB 
#include <bits/stdc++.h>
#define DIM 1000010
using namespace std;

int v[DIM],sp[DIM];
deque <pair<int,int> > d;
int n,i;

int main (){

    //ifstream cin ("date.in");
    //ofstream cout ("date.out");

    cin>>n;
    for (i=1;i<=n;i++)
        cin>>v[i];

    int lg = (n+1) / 2;

    for (i=n+1;i<=2*n;i++)
        v[i] = v[i-n];

    for (i=1;i<=2*n;i++)
        sp[i] = sp[i-1] + v[i];

    for (i=lg;i<2*lg;i++){
        while (!d.empty() && sp[i] - sp[i-lg] <= d.back().first)
            d.pop_back();
        d.push_back(make_pair(sp[i] - sp[i-lg],i));
    }

    int sol = d.front().first;

    for (i=2*lg;i<=2*n;i++){
        while (!d.empty() && sp[i] - sp[i-lg] <= d.back().first)
            d.pop_back();
        d.push_back(make_pair(sp[i] - sp[i-lg],i));

        while (d.front().second <= i-lg)
            d.pop_front();

        sol = max (sol,d.front().first);
    }

    cout<<sol;

    return 0;
}

Subtask #1
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 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 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 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 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 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 384 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 1 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 41 ms 1912 KB Output is correct
5 Correct 94 ms 4216 KB Output is correct
6 Correct 124 ms 5368 KB Output is correct
7 Correct 153 ms 6404 KB Output is correct
8 Correct 250 ms 10504 KB Output is correct

Subtask #4
40.0 / 40.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 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 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 1 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 41 ms 1912 KB Output is correct
36 Correct 94 ms 4216 KB Output is correct
37 Correct 124 ms 5368 KB Output is correct
38 Correct 153 ms 6404 KB Output is correct
39 Correct 250 ms 10504 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 10 ms 768 KB Output is correct
42 Correct 16 ms 896 KB Output is correct
43 Correct 99 ms 4344 KB Output is correct
44 Correct 248 ms 10360 KB Output is correct
45 Correct 44 ms 2296 KB Output is correct
46 Correct 149 ms 6392 KB Output is correct
47 Correct 247 ms 10324 KB Output is correct
48 Correct 262 ms 10616 KB Output is correct
49 Correct 193 ms 11812 KB Output is correct
50 Correct 193 ms 11812 KB Output is correct