oj.uz

Submission #282212

# Submission time Handle Problem Language Result Execution time Memory
282212 2020-08-24T06:54:15 Z jainbot27 Watching (JOI13_watching) C++17
100 / 100
 495 ms 16404 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
    int n, p, q;
    cin >> n >> p >> q;
    if(p + q >= n) {
        cout <<"1\n";
        return 0;
    }
    vector<int> a(n);
    for(int&A:a) cin >> A;
    sort(a.begin(), a.end());
    int lo = 1, hi = 1e9;
    while(lo <= hi){
        int mid = (lo + hi) / 2;
        vector<vector<int>> dp(n + 1, vector<int>(n + 1, -(1)));
        vector<int> P(n + 1), Q(n + 1);
        //cerr << "HERE\n";
        for(int i=0; i < n; i++){
            P[i] = (lower_bound(a.begin(), a.end(), a[i] + mid) - a.begin()) - i;
            //cerr << "P " << P[i] << endl;
        }
        for(int i=0; i < n; i++){
            Q[i] = (lower_bound(a.begin(), a.end(), a[i] + mid * 2) - a.begin()) - i;
            //cerr << "Q " << Q[i] << endl;
        }
        dp[0][0] = 0;
        bool good = 0;
        for(int i=0; i <= p; i++){
            for(int j=0; j <= q; j++){
                if(dp[i][j] == n){
                    good = 1;
                }
                if(dp[i][j] != -1 || (i == 0 && j == 0)){
                    dp[i + 1][j] = max(dp[i+1][j], P[dp[i][j]] + dp[i][j]);
                    dp[i][j + 1] = max(dp[i][j + 1], Q[dp[i][j]] + dp[i][j]);
                }
                //cerr << "(" << i << "," << j << ") " << dp[i][j] << endl;
            }
        }
        if(good){
            hi = mid - 1;
        }
        else{
            lo = mid + 1;
        }
    }
    cout << lo << endl;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 16248 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 272 ms 16232 KB Output is correct
8 Correct 297 ms 16264 KB Output is correct
9 Correct 300 ms 16360 KB Output is correct
10 Correct 321 ms 16184 KB Output is correct
11 Correct 323 ms 16352 KB Output is correct
12 Correct 495 ms 16200 KB Output is correct
13 Correct 281 ms 16404 KB Output is correct
14 Correct 278 ms 16392 KB Output is correct
15 Correct 284 ms 16300 KB Output is correct