oj.uz

Submission #554584

# Submission time Handle Problem Language Result Execution time Memory
554584 2022-04-28T19:19:20 Z Soumya1 Hacker (BOI15_hac) C++17
100 / 100
 291 ms 22316 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
const int mxN = 1e6 + 5;
long long a[mxN];
multiset<long long> s;
void testCase() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) a[i + n] = a[i];
  for (int i = 1; i <= 2 * n; i++) a[i] += a[i - 1];
  int x = (n + 1) / 2;
  for (int i = x; i < x + x; i++) s.insert(a[i] - a[i - x]);
  long long ans = *s.begin();
  for (int i = x + 1; i <= 2 * n - x + 1; i++) {
    s.erase(s.find(a[i - 1] - a[i - x - 1]));
    s.insert(a[i + x - 1] - a[i - 1]);
    ans = max(ans, *s.begin());
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 32 ms 3740 KB Output is correct
5 Correct 85 ms 8904 KB Output is correct
6 Correct 112 ms 11184 KB Output is correct
7 Correct 142 ms 13472 KB Output is correct
8 Correct 290 ms 22052 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 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 468 KB Output is correct
23 Correct 2 ms 472 KB Output is correct
24 Correct 1 ms 404 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 500 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 32 ms 3740 KB Output is correct
36 Correct 85 ms 8904 KB Output is correct
37 Correct 112 ms 11184 KB Output is correct
38 Correct 142 ms 13472 KB Output is correct
39 Correct 290 ms 22052 KB Output is correct
40 Correct 4 ms 724 KB Output is correct
41 Correct 7 ms 1108 KB Output is correct
42 Correct 11 ms 1620 KB Output is correct
43 Correct 91 ms 8900 KB Output is correct
44 Correct 263 ms 21964 KB Output is correct
45 Correct 37 ms 4564 KB Output is correct
46 Correct 129 ms 13268 KB Output is correct
47 Correct 291 ms 22160 KB Output is correct
48 Correct 226 ms 22316 KB Output is correct
49 Correct 210 ms 21436 KB Output is correct
50 Correct 211 ms 21468 KB Output is correct