oj.uz

답안 #1089004

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089004 2024-09-15T18:15:17 Z distiled 구경하기 (JOI13_watching) C++14
50 / 100
 1000 ms 31936 KB 
/**
 * Author: distiled
 */
#include<bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include </Users/distiled/codeStuff/templates/debug.h>
#else
#define dbg(x...)
#endif
#define int int64_t


signed main() {
  ios::sync_with_stdio(false); 
  cin.tie(0);
  int n, p, q;
  cin >> n >> p >> q;
  vector<int> a(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a.begin() + 1, a.end());
  auto ok = [&] (int w) -> bool {
    const int inf = int(1e9);
    vector<vector<int>> dp(n + 1, vector<int>(min(n + 1, p + 1), inf));
    dp[0][0] = 0;
    // dbg(w);
    for (int j = 1; j <= min(n, p); j++) {
      int small = 1, large = 1;
      dp[0][j] = 0;
      for (int i = 1; i <= n; i++) {
        while (small <= i) {
          if (a[i] - a[small] + 1 > w) {
            small += 1;
          } else {
            break;
          }
        }
        while (large <= i) {
          if (a[i] - a[large] + 1 > 2 * w) {
            large += 1;
          } else {
            break;
          }
        }
        // dbg(large, small, i);
        dp[i][j] = min({dp[i][j], dp[small - 1][j - 1], dp[large - 1][j] + 1});
      }
    }
    bool ok = false;
    for (int j = 1; j <= min(n, p); j++) {
      ok |= dp[n][j] <= q;
    }
    return ok;
  };

  int l = 0, r = int(1e9), ans = 1e9;
  while (l <= r) {
    int m = (l + r) >> 1;
    if (ok(m)) {
      r = m - 1;
      ans = m;
    } else {
      l = m + 1;
    }
  }
  cout << ans << '\n';
}

Subtask #1
50.0 / 50.0

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

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 835 ms 24096 KB Output is correct
4 Execution timed out 1027 ms 31936 KB Time limit exceeded
5 Halted 0 ms 0 KB -