oj.uz

Submission #798202

# Submission time Handle Problem Language Result Execution time Memory
798202 2023-07-30T13:24:48 Z tch1cherin Hacker (BOI15_hac) C++17
20 / 100
 105 ms 11224 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N;
  cin >> N;
  vector<int> A(2 * N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    A[i + N] = A[i];
  }
  int M = (N + 1) / 2;
  vector<int> B(2 * N);
  for (int i = 0; i < 2 * N; i++) {
    if (i > 0) {
      B[i] += B[i - 1];
    }
    B[i] += A[i];
    if (i >= M) {
      B[i] -= A[i - M];
    } 
  }
  int ans = 0;
  deque<int> dq;
  for (int i = 0; i + M <= 2 * N; i++) {
    while (!dq.empty() && B[dq.back()] >= B[i]) {
      dq.pop_back();
    }
    dq.push_back(i);
    if (dq.front() + M <= i) {
      dq.pop_front();
    }
    ans = max(ans, B[dq.front()]);
  }
  cout << ans << "\n";
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 17 ms 1708 KB Output is correct
5 Correct 37 ms 4536 KB Output is correct
6 Correct 51 ms 5700 KB Output is correct
7 Correct 63 ms 6856 KB Output is correct
8 Correct 105 ms 11224 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 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 Incorrect 0 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -