oj.uz

답안 #1006061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1006061 2024-06-23T10:51:48 Z tch1cherin Seesaw (JOI22_seesaw) C++17
100 / 100
 152 ms 10704 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N;
  cin >> N;
  vector<int> A(N);
  for (int &value : A) {
    cin >> value;
  }
  vector<long long> pref(N + 1);
  for (int i = 0; i < N; i++) {
    pref[i + 1] = pref[i] + A[i];
  }
  auto Mean = [&](int L, int R) { return 1.L * (pref[R] - pref[L]) / (R - L); };
  vector<array<int, 2>> seg = {{0, N}};
  for (int len = 1; len < N; len++) {
    int low = -1, high = N - len + 1;
    while (high - low > 1) {
      int mid = (low + high) / 2;
      if (Mean(mid, mid + len) <= Mean(0, N)) {
        low = mid;
      } else {
        high = mid;
      }
    }
    if (low >= 0) {
      seg.push_back({low, low + len});
    }
    if (high + len <= N) {
      seg.push_back({high, high + len});
    }
  }
  sort(seg.begin(), seg.end(), [&](array<int, 2> x, array<int, 2> y) {
    return Mean(x[0], x[1]) < Mean(y[0], y[1]);
  });
  vector<int> cnt(N + 1);
  int bad_count = N;
  long double result = numeric_limits<long double>::max();
  for (int i = 0, j = 0; i < int(seg.size()); i++) {
    while (j < int(seg.size()) && bad_count > 0) {
      bad_count -= cnt[seg[j][1] - seg[j][0]]++ == 0;
      j++;
    }
    if (bad_count == 0) {
      result = min(result, Mean(seg[j - 1][0], seg[j - 1][1]) - Mean(seg[i][0], seg[i][1]));
    }
    bad_count += --cnt[seg[i][1] - seg[i][0]] == 0;
  }
  cout << result << "\n";
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 568 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #4
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 568 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 152 ms 10704 KB Output is correct
13 Correct 145 ms 9676 KB Output is correct
14 Correct 150 ms 10700 KB Output is correct
15 Correct 151 ms 8856 KB Output is correct
16 Correct 149 ms 10440 KB Output is correct