Submission #632278

# Submission time Handle Problem Language Result Execution time Memory
632278 2022-08-19T19:38:46 Z EthanKim8683 Hacker (BOI15_hac) C++17
100 / 100
53 ms 8652 KB
#include<iostream>
#include<cstdio>
#include<deque>

using namespace std;

using I=int;

const I N=500000;

I v_arr[N];
I rngs[N];
deque<pair<I,I>>que;
I cnt1=0,cnt2=0;

void add(I val){
  while(que.size()&&que.back().first>val)que.pop_back();
  que.push_back({val,cnt1++});
}

void rem(){
  if(que.size()&&que.front().second==cnt2)que.pop_front();
  cnt2++;
}

I qry(){
  return que.front().first;
}

I main(){
  cin.tie(0)->sync_with_stdio(0);
  I n;cin>>n;
  for(I i=0;i<n;i++)cin>>v_arr[i];
  I tot=0;
  for(I i=0;i<n;i++)tot+=v_arr[i];
  I low=n/2,upp=n-low;
  I sum=0;
  for(I i=0;i<upp;i++)sum+=v_arr[i];
  for(I i=0;i<n;i++){
    rngs[i]=sum;
    sum+=v_arr[(i+upp)%n]-v_arr[i];
  }
  for(I i=0;i<upp;i++)add(rngs[i]);
  I res=0;
  for(I i=0;i<n;i++){
    res=max(res,qry());
    add(rngs[(i+upp)%n]),rem();
  }
  printf("%i\n",res);
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 328 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 368 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 9 ms 1236 KB Output is correct
5 Correct 19 ms 2632 KB Output is correct
6 Correct 29 ms 3324 KB Output is correct
7 Correct 31 ms 4036 KB Output is correct
8 Correct 49 ms 6400 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 328 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 368 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 9 ms 1236 KB Output is correct
36 Correct 19 ms 2632 KB Output is correct
37 Correct 29 ms 3324 KB Output is correct
38 Correct 31 ms 4036 KB Output is correct
39 Correct 49 ms 6400 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 5 ms 600 KB Output is correct
43 Correct 20 ms 2664 KB Output is correct
44 Correct 52 ms 6372 KB Output is correct
45 Correct 10 ms 1364 KB Output is correct
46 Correct 31 ms 3924 KB Output is correct
47 Correct 53 ms 6400 KB Output is correct
48 Correct 43 ms 8652 KB Output is correct
49 Correct 43 ms 7860 KB Output is correct
50 Correct 39 ms 7872 KB Output is correct