Submission #1015360

#TimeUsernameProblemLanguageResultExecution timeMemory
1015360overwatch9Watching (JOI13_watching)C++17
0 / 100
12 ms600 KiB
#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'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...