oj.uz

답안 #651142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651142 2022-10-17T11:35:29 Z alvinpiter Hacker (BOI15_hac) C++14
0 / 100
 81 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, 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;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2256 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 33 ms 2132 KB Output is correct
8 Correct 33 ms 2132 KB Output is correct
9 Correct 34 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 35 ms 2132 KB Output is correct
12 Correct 34 ms 2132 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Incorrect 2 ms 2260 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2256 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 33 ms 2132 KB Output is correct
8 Correct 33 ms 2132 KB Output is correct
9 Correct 34 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 35 ms 2132 KB Output is correct
12 Correct 34 ms 2132 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Incorrect 2 ms 2260 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Incorrect 81 ms 2232 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 2 ms 2252 KB Output is correct
3 Correct 1 ms 2132 KB Output is correct
4 Correct 2 ms 2256 KB Output is correct
5 Correct 3 ms 2132 KB Output is correct
6 Correct 2 ms 2132 KB Output is correct
7 Correct 33 ms 2132 KB Output is correct
8 Correct 33 ms 2132 KB Output is correct
9 Correct 34 ms 2132 KB Output is correct
10 Correct 36 ms 2132 KB Output is correct
11 Correct 35 ms 2132 KB Output is correct
12 Correct 34 ms 2132 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2132 KB Output is correct
15 Incorrect 2 ms 2260 KB Output isn't correct
16 Halted 0 ms 0 KB -