oj.uz

Submission #1015360

# Submission time Handle Problem Language Result Execution time Memory
1015360 2024-07-06T09:19:08 Z overwatch9 Watching (JOI13_watching) C++17
0 / 100
 12 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> events;
vector <vector <int>> dp;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int p, q;
    cin >> n >> p >> q;
    events = vector <int> (n+1);
    for (int i = 1; i <= n; i++)
        cin >> events[i];
    sort(events.begin(), events.end());
    if (p + q >= n) {
        cout << 1 << '\n';
        return 0;
    }
    dp = vector <vector <int>> (n+1, vector <int> (p+1, 1e9));
    int lo = 1, hi = 1e9;
    while (lo < hi) {
        int mid = lo + (hi - lo) / 2;
        dp[0][0] = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= p; j++) {
                dp[i][j] = 1e9;
                int it = upper_bound(events.begin(), events.end(), events[i] - 2*mid) - events.begin();
                dp[i][j] = dp[max(0, it-1)][j] + 1; 
                if (j > 0) {
                    it = upper_bound(events.begin(), events.end(), events[i] - mid) - events.begin();
                    dp[i][j] = min(dp[i][j], dp[max(0, it-1)][j-1]);
                }
            }
        }
        if (dp[n][p] > q)
            lo = mid + 1;
        else
            hi = mid;
    }
    cout << lo << '\n';
}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 1 ms 344 KB Output is correct
7 Incorrect 12 ms 600 KB Output isn't correct
8 Halted 0 ms 0 KB -