oj.uz

Submission #768953

# Submission time Handle Problem Language Result Execution time Memory
768953 2023-06-29T01:57:36 Z JayGh Hacker (BOI15_hac) C++14
0 / 100
 1 ms 316 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main() {
  //Console
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  int half = N/2 + N%2;
  //cout << half;
  vector<int> arr(N);
  for(int i = 0; i < N; i++){
  	cin >> arr[i];
  }

  vector<int> cwWinSum(N);
  int sum = 0;
  for(int i = (N - (half)); i < N; i++){
  	sum += arr[i];
  }
  //iniSum += arr[0];

  for(int i = 0; i < N; i++){
  	int idx = i - half;
  	if(idx < 0) {idx = N+idx;}
  	//cout << arr[idx] << "\n";
  	sum -= arr[idx];
  	sum += arr[i];
  	cwWinSum[i] = sum;
  }
  // for(int i = 0; i < N; i++){
  // 	cout << cwWinSum[i] << "\n";
  // }

  vector<int> ccwWinSum(N);
  sum = 0;
  for(int i = 0; i < half; i++){
  	sum += arr[i];
  }

  for(int i = N-1; i >= 0; i--){
  	int idx = i + half;
  	if(idx >= N) idx -= N;
  	sum -= arr[idx];
  	sum += arr[i];
  	ccwWinSum[i] = sum;
  }
  int ans = INT_MIN;
  for(int i = 0; i < N; i++){
  	ans = max(ans, min(cwWinSum[i], ccwWinSum[i]));
  }
  cout << ans;


}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 316 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 316 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 316 KB Output isn't correct
3 Halted 0 ms 0 KB -