oj.uz

답안 #909619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
909619 2024-01-17T09:54:20 Z schzeey 구경하기 (JOI13_watching) C++14
50 / 100
 509 ms 30572 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a, b;
vector <int> arr;
bool check(int ans){
    vector<vector<int>> dp(n+1, vector<int>(a+1, 0));
    for (int i = 1; i <= n; ++i){
        int pa = i, pb = i;
        do pa--; while(pa != 0 && arr[i]-arr[pa] < ans);
        do pb--; while(pb != 0 && arr[i]-arr[pb] < 2*ans);
        for (int j = 0; j < a+1; ++j){
            if (i == 0) dp[i][j] = dp[pb][j]+1;
            else dp[i][j] = min(dp[pb][j]+1, dp[pa][j-1]);
        }
    }
    return *min_element(dp[n].begin(), dp[n].end()) <= b;
}

int32_t main(){
    cin >> n >> a >> b;
    arr.resize(n+1);
    arr[0] = -1e5;
    for (int i = 1; i <= n; ++i) cin >> arr[i];
    if (a+b >= n) return cout<<1, 0;
    sort(arr.begin(), arr.end());
    //for (auto e: arr) cout << e << " ";
    int lf = 0, ri = 1e9;
    while (lf <= ri){
        int mid = (lf+ri)/2;
        //cout << mid << " ";
        if (check(mid)) ri = mid-1;
        else lf = mid+1;

    }
    cout << lf;

}

Subtask #1
50.0 / 50.0

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

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 20 ms 748 KB Output is correct
8 Correct 33 ms 2680 KB Output is correct
9 Correct 207 ms 12672 KB Output is correct
10 Correct 509 ms 30572 KB Output is correct
11 Incorrect 25 ms 1908 KB Output isn't correct
12 Halted 0 ms 0 KB -