oj.uz

Submission #535688

# Submission time Handle Problem Language Result Execution time Memory
535688 2022-03-10T23:17:17 Z __Variatto Hacker (BOI15_hac) C++17
100 / 100
 70 ms 10188 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int MAX=5e5+10;
int n, t[2*MAX], pref[2*MAX];
deque<pair<int,int>>kol;
void dodaj(int x, int i){
    while(kol.size() && kol.back().fi<x)
        kol.pop_back();
    kol.pb({x, i});
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin>>n;
    for(int i=1; i<=n; i++){
        cin>>t[i];
        t[i+n]=t[i];
    }
    int maxi=0;
    for(int i=1; i<=2*n; i++)
        pref[i]=pref[i-1]+t[i];
    for(int i=2; i<=n-(n/2)+1; i++)
        dodaj(pref[i+n/2-1]-pref[i-1], i);
    int l=n-(n/2)+1;
    for(int i=1; i<=n; i++){
        while(kol.size()&&kol.front().se<=i)
            kol.pop_front();
        //cout<<i<<": "<<l+(n/2)-1<<" "<<l-1<<"  "<<pref[l+(n/2)-1]-pref[l-1]<<"\n";
        dodaj(pref[l+(n/2)-1]-pref[l-1], l);
        l++;
        //cout<<kol.front().fi<<" "<<kol.front().se<<"\n";
        maxi=max(maxi, pref[n]-kol.front().fi);
    }
    cout<<maxi<<"\n";
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 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 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 412 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 10 ms 1516 KB Output is correct
5 Correct 19 ms 3364 KB Output is correct
6 Correct 26 ms 4180 KB Output is correct
7 Correct 32 ms 4992 KB Output is correct
8 Correct 51 ms 8136 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 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 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 412 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 10 ms 1516 KB Output is correct
36 Correct 19 ms 3364 KB Output is correct
37 Correct 26 ms 4180 KB Output is correct
38 Correct 32 ms 4992 KB Output is correct
39 Correct 51 ms 8136 KB Output is correct
40 Correct 2 ms 544 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 4 ms 724 KB Output is correct
43 Correct 20 ms 3408 KB Output is correct
44 Correct 70 ms 8076 KB Output is correct
45 Correct 11 ms 1876 KB Output is correct
46 Correct 34 ms 5008 KB Output is correct
47 Correct 51 ms 8032 KB Output is correct
48 Correct 45 ms 10108 KB Output is correct
49 Correct 40 ms 10092 KB Output is correct
50 Correct 41 ms 10188 KB Output is correct