oj.uz

Submission #86095

# Submission time Handle Problem Language Result Execution time Memory
86095 2018-11-24T20:32:05 Z igzi Hacker (BOI15_hac) C++17
100 / 100
 310 ms 29564 KB 
#include <bits/stdc++.h>
#define maxN 500005

using namespace std;

int seg[4*maxN],a[2*maxN],b[maxN],n,i,d,ans,sum;

void update(int n,int l,int d,int x,int y){
if(l==d) seg[n]=y;
else{
    int m=(l+d)/2;
    if(x<=m) update(2*n,l,m,x,y);
    else update(2*n+1,m+1,d,x,y);
    seg[n]=max(seg[2*n],seg[2*n+1]);
}
}
int query(int n,int l,int d,int x,int y){
if(d<x || l>y || x>y) return 0;
if(l>=x && y>=d) return seg[n];
int m=(l+d)/2;
return max(query(2*n,l,m,x,y),query(2*n+1,m+1,d,x,y));
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    cin>>n;
    d=n/2;
    for(i=0;i<n;i++) {cin>>a[i]; a[n+i]=a[i]; sum+=a[i];}
    for(i=0;i<d;i++) b[0]+=a[i];
    update(1,0,n-1,0,b[0]);
    for(i=1;i<n;i++) {b[i]=b[i-1]-a[i-1]+a[i+d-1]; update(1,0,n-1,i,b[i]);}
    for(i=0;i<n;i++){
        ans=max(ans,sum-max(query(1,0,n-1,0,i-d),query(1,0,n-1,i+1,min(n-1,n+i-d))));
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 544 KB Output is correct
12 Correct 2 ms 544 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 720 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 544 KB Output is correct
12 Correct 2 ms 544 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 720 KB Output is correct
19 Correct 2 ms 728 KB Output is correct
20 Correct 2 ms 732 KB Output is correct
21 Correct 2 ms 736 KB Output is correct
22 Correct 3 ms 740 KB Output is correct
23 Correct 4 ms 884 KB Output is correct
24 Correct 3 ms 884 KB Output is correct
25 Correct 5 ms 984 KB Output is correct
26 Correct 4 ms 1024 KB Output is correct
27 Correct 2 ms 1024 KB Output is correct
28 Correct 2 ms 1024 KB Output is correct
29 Correct 2 ms 1024 KB Output is correct
30 Correct 4 ms 1060 KB Output is correct
31 Correct 5 ms 1096 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1096 KB Output is correct
2 Correct 2 ms 1096 KB Output is correct
3 Correct 4 ms 1112 KB Output is correct
4 Correct 49 ms 3312 KB Output is correct
5 Correct 107 ms 6548 KB Output is correct
6 Correct 135 ms 8216 KB Output is correct
7 Correct 170 ms 12164 KB Output is correct
8 Correct 310 ms 16820 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 532 KB Output is correct
8 Correct 2 ms 532 KB Output is correct
9 Correct 2 ms 532 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 2 ms 544 KB Output is correct
12 Correct 2 ms 544 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 2 ms 660 KB Output is correct
16 Correct 2 ms 696 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 720 KB Output is correct
19 Correct 2 ms 728 KB Output is correct
20 Correct 2 ms 732 KB Output is correct
21 Correct 2 ms 736 KB Output is correct
22 Correct 3 ms 740 KB Output is correct
23 Correct 4 ms 884 KB Output is correct
24 Correct 3 ms 884 KB Output is correct
25 Correct 5 ms 984 KB Output is correct
26 Correct 4 ms 1024 KB Output is correct
27 Correct 2 ms 1024 KB Output is correct
28 Correct 2 ms 1024 KB Output is correct
29 Correct 2 ms 1024 KB Output is correct
30 Correct 4 ms 1060 KB Output is correct
31 Correct 5 ms 1096 KB Output is correct
32 Correct 2 ms 1096 KB Output is correct
33 Correct 2 ms 1096 KB Output is correct
34 Correct 4 ms 1112 KB Output is correct
35 Correct 49 ms 3312 KB Output is correct
36 Correct 107 ms 6548 KB Output is correct
37 Correct 135 ms 8216 KB Output is correct
38 Correct 170 ms 12164 KB Output is correct
39 Correct 310 ms 16820 KB Output is correct
40 Correct 6 ms 16820 KB Output is correct
41 Correct 11 ms 16820 KB Output is correct
42 Correct 16 ms 16820 KB Output is correct
43 Correct 115 ms 16820 KB Output is correct
44 Correct 286 ms 19980 KB Output is correct
45 Correct 54 ms 19980 KB Output is correct
46 Correct 169 ms 19980 KB Output is correct
47 Correct 279 ms 23868 KB Output is correct
48 Correct 275 ms 26296 KB Output is correct
49 Correct 307 ms 27844 KB Output is correct
50 Correct 274 ms 29564 KB Output is correct