Submission #651143

# Submission time Handle Problem Language Result Execution time Memory
651143 2022-10-17T11:38:19 Z alvinpiter Hacker (BOI15_hac) C++14
20 / 100
1000 ms 2260 KB
#include<bits/stdc++.h>
using namespace std;

int main() {
  int n, a[500003], ans;

  cin >> n;

  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }

  int cntTakenByPlayer = n/2 + n%2;

  ans = 0;
  for (int i = 0; i < n; i++) {
    // i-th is player's first move

    int minSum = 1000000000;
    for (int prev = 0; prev < cntTakenByPlayer; prev++) {
      int currSum = 0;
      for (int j = (i - 1 + n)%n, cnt = 0; cnt < prev; j = (j - 1 + n)%n, cnt++) {
        currSum += a[j];
      }

      for (int j = i, cnt = 0; cnt < cntTakenByPlayer - prev; j = (j + 1)%n, cnt++) {
        currSum += a[j];
      }

      minSum = min(minSum, currSum);
    }

    ans = max(ans, minSum);
  }

  cout << ans << endl;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2132 KB Output is correct
2 Correct 1 ms 2132 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 35 ms 2172 KB Output is correct
8 Correct 35 ms 2132 KB Output is correct
9 Correct 35 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 36 ms 2132 KB Output is correct
12 Correct 35 ms 2132 KB Output is correct
13 Correct 1 ms 2132 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Correct 1 ms 2132 KB Output is correct
16 Correct 35 ms 2132 KB Output is correct
17 Correct 36 ms 2132 KB Output is correct
18 Correct 34 ms 2232 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2132 KB Output is correct
2 Correct 1 ms 2132 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 35 ms 2172 KB Output is correct
8 Correct 35 ms 2132 KB Output is correct
9 Correct 35 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 36 ms 2132 KB Output is correct
12 Correct 35 ms 2132 KB Output is correct
13 Correct 1 ms 2132 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Correct 1 ms 2132 KB Output is correct
16 Correct 35 ms 2132 KB Output is correct
17 Correct 36 ms 2132 KB Output is correct
18 Correct 34 ms 2232 KB Output is correct
19 Correct 158 ms 2232 KB Output is correct
20 Execution timed out 1077 ms 2132 KB Time limit exceeded
21 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2132 KB Output is correct
2 Correct 83 ms 2228 KB Output is correct
3 Execution timed out 1094 ms 2260 KB Time limit exceeded
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2132 KB Output is correct
2 Correct 1 ms 2132 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2132 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 35 ms 2172 KB Output is correct
8 Correct 35 ms 2132 KB Output is correct
9 Correct 35 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 36 ms 2132 KB Output is correct
12 Correct 35 ms 2132 KB Output is correct
13 Correct 1 ms 2132 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Correct 1 ms 2132 KB Output is correct
16 Correct 35 ms 2132 KB Output is correct
17 Correct 36 ms 2132 KB Output is correct
18 Correct 34 ms 2232 KB Output is correct
19 Correct 158 ms 2232 KB Output is correct
20 Execution timed out 1077 ms 2132 KB Time limit exceeded
21 Halted 0 ms 0 KB -