Submission #949257

# Submission time Handle Problem Language Result Execution time Memory
949257 2024-03-19T04:14:11 Z Sir_Ahmed_Imran Hacker (BOI15_hac) C++17
100 / 100
216 ms 31748 KB
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define append push_back
#define add insert
#define nl "\n"
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define N 500001
int n;
int a[N];
int Add[N];
int REM[N];
map<int,int> Remov;
int get(int l,int r){
    if(l>r)
        return a[n]-a[l-1]+a[r];
    return a[r]-a[l-1];
}
void solve(){
    int m,o;
    cin>>n;
    m=n/2;
    for(int i=o=1;i<=n;i++){
        cin>>a[i];
        a[i]+=a[i-1];
    }
    for(int i=1;i<m;i++){
        Add[i+1]=get(n-m+i+1,i);
        REM[n-m+i+1]=get(n-m+i+1,i);
    }
    Add[m+1]=get(1,m);
    priority_queue<int> Q;
    for(int i=m+1;i<=n;i++){
        Q.push(get(i-m+1,i));
        Add[i+1]=get(i-m+1,i);
        REM[i-m+1]=get(i-m+1,i);
    }
    for(int i=1;i<=n;i++){
        Q.push(Add[i]);
        Remov[REM[i]]++;
        while(Remov[Q.top()]){
            Remov[Q.top()]--;
            Q.pop();
        }
        o=max(o,a[n]-Q.top());
    }
    cout<<o;
}
int main(){
    L0TA;
    solve();
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4696 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 26 ms 8444 KB Output is correct
5 Correct 68 ms 11568 KB Output is correct
6 Correct 89 ms 15048 KB Output is correct
7 Correct 100 ms 17356 KB Output is correct
8 Correct 157 ms 22408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4444 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4440 KB Output is correct
22 Correct 1 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 2 ms 4700 KB Output is correct
26 Correct 2 ms 4700 KB Output is correct
27 Correct 1 ms 4440 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4444 KB Output is correct
30 Correct 2 ms 4696 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 2 ms 4700 KB Output is correct
35 Correct 26 ms 8444 KB Output is correct
36 Correct 68 ms 11568 KB Output is correct
37 Correct 89 ms 15048 KB Output is correct
38 Correct 100 ms 17356 KB Output is correct
39 Correct 157 ms 22408 KB Output is correct
40 Correct 3 ms 4956 KB Output is correct
41 Correct 5 ms 5212 KB Output is correct
42 Correct 9 ms 5980 KB Output is correct
43 Correct 70 ms 12748 KB Output is correct
44 Correct 169 ms 26564 KB Output is correct
45 Correct 25 ms 6364 KB Output is correct
46 Correct 101 ms 17604 KB Output is correct
47 Correct 140 ms 23444 KB Output is correct
48 Correct 46 ms 7380 KB Output is correct
49 Correct 216 ms 31748 KB Output is correct
50 Correct 210 ms 31652 KB Output is correct