oj.uz

Submission #909592

# Submission time Handle Problem Language Result Execution time Memory
909592 2024-01-17T09:36:12 Z schzeey Watching (JOI13_watching) C++14
0 / 100
 496 ms 30840 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(arr[i]-arr[pa] <= ans);
        do pb--; while(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 dp[n][a] <= b;
}

int32_t main(){
    cin >> n >> a >> b;
    arr.resize(n+1);
    for (int i = 1; i <= n; ++i) cin >> arr[i];
    if (a+b >= n) return cout<<1, 0;
    arr[0] = -1e9;
    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+1;

}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 528 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 15 ms 604 KB Output is correct
8 Correct 31 ms 2608 KB Output is correct
9 Correct 193 ms 12432 KB Output is correct
10 Correct 496 ms 30840 KB Output is correct
11 Incorrect 22 ms 1920 KB Output isn't correct
12 Halted 0 ms 0 KB -