oj.uz

Submission #228338

# Submission time Handle Problem Language Result Execution time Memory
228338 2020-04-30T15:13:50 Z quocnguyen1012 Hacker (BOI15_hac) C++14
100 / 100
 76 ms 22524 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
#define int long long

using namespace std;
typedef long long ll;
typedef pair<int, int> ii;

const int maxn = 1e6 + 5;

int a[maxn], sum[maxn], N;

signed main(void)
{
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  #ifdef LOCAL
    freopen("A.INP", "r", stdin);
    freopen("A.OUT", "w", stdout);
  #endif // LOCAL
  int tot = 0;
  cin >> N;
  for(int i = 1; i <= N; ++i){
    cin >> a[i];
    a[i + N] = a[i];
    tot += a[i];
  }
  for(int i = 1; i <= 2 * N; ++i){
    sum[i] = sum[i - 1] + a[i];
  }
  deque<ii> dq;
  int j;
  for(int i = 1; i <= N - N / 2 + 1; ++i){
    int v = sum[i + N / 2 - 1] - sum[i - 1];
    while(dq.size() && dq.back().fi < v) dq.pop_back();
    dq.eb(v, i);
    j = i;
  }
  int res = 0;
  for(int i = 1; i <= N; ++i){
    while(dq.size() && dq.front().se == i) dq.pop_front();
    res = max(res, tot - dq.front().fi);
    ++j;
    int v = sum[j + N / 2 - 1] - sum[j - 1];
    while(dq.size() && dq.back().fi < v) dq.pop_back();
    dq.eb(v, j);
  }
  cout << res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 16 ms 2816 KB Output is correct
5 Correct 30 ms 6656 KB Output is correct
6 Correct 38 ms 8276 KB Output is correct
7 Correct 46 ms 9720 KB Output is correct
8 Correct 74 ms 15992 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 16 ms 2816 KB Output is correct
36 Correct 30 ms 6656 KB Output is correct
37 Correct 38 ms 8276 KB Output is correct
38 Correct 46 ms 9720 KB Output is correct
39 Correct 74 ms 15992 KB Output is correct
40 Correct 7 ms 668 KB Output is correct
41 Correct 7 ms 992 KB Output is correct
42 Correct 9 ms 1408 KB Output is correct
43 Correct 31 ms 7552 KB Output is correct
44 Correct 75 ms 18168 KB Output is correct
45 Correct 18 ms 3840 KB Output is correct
46 Correct 45 ms 11008 KB Output is correct
47 Correct 76 ms 18168 KB Output is correct
48 Correct 67 ms 22524 KB Output is correct
49 Correct 63 ms 21752 KB Output is correct
50 Correct 63 ms 21752 KB Output is correct