oj.uz

답안 #38196

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
38196 2018-01-03T01:24:39 Z funcsr 구경하기 (JOI13_watching) C++14
100 / 100
 266 ms 17680 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define index(a, b, y) (int)(lower_bound(a, b, y) - a)
#define INF 1000001919
inline void chmin(int &x, int v) { if (x > v) x = v; }
int N, A, B;
int X[2000];
int Fsmall[2000], Flarge[2000];
int dp[2001][2001];

bool f(int W) {
  rep(i, N) {
    Fsmall[i] = index(X, X+N, X[i]+W);
    Flarge[i] = index(X, X+N, X[i]+2*W);
  }
  rep(i, N+1) rep(j, A+1) dp[i][j] = INF;
  dp[0][0] = 0;
  rep(i, N) {
    rep(j, A+1) {
      if (dp[i][j] == INF) continue;
      if (j < A) chmin(dp[Fsmall[i]][j+1], dp[i][j]);
      if (dp[i][j] < B) chmin(dp[Flarge[i]][j], dp[i][j]+1);
    }
  }
  int m = INF;
  rep(i, A+1) chmin(m, dp[N][i]);
  return m <= B;
}

int main() {
  cin >> N >> A >> B;
  rep(i, N) cin >> X[i];
  sort(X, X+N);
  if (A+B >= N) {
    cout << 1 << "\n";
    return 0;
  }

  int lo = 0, hi = INF;
  while (hi-lo > 1) {
    int mid = (lo+hi)/2;
    if (f(mid)) hi = mid;
    else lo = mid;
  }
  cout << hi << "\n";
  return 0;
}

Subtask #1
50.0 / 50.0

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

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 17680 KB Output is correct
2 Correct 0 ms 17680 KB Output is correct
3 Correct 0 ms 17680 KB Output is correct
4 Correct 0 ms 17680 KB Output is correct
5 Correct 0 ms 17680 KB Output is correct
6 Correct 0 ms 17680 KB Output is correct
7 Correct 13 ms 17680 KB Output is correct
8 Correct 33 ms 17680 KB Output is correct
9 Correct 109 ms 17680 KB Output is correct
10 Correct 266 ms 17680 KB Output is correct
11 Correct 29 ms 17680 KB Output is correct
12 Correct 156 ms 17680 KB Output is correct
13 Correct 13 ms 17680 KB Output is correct
14 Correct 16 ms 17680 KB Output is correct
15 Correct 13 ms 17680 KB Output is correct