# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147281 | karma | Watching (JOI13_watching) | C++11 | 635 ms | 30328 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#pragma GCC optimization ("O3")
#define ll long long
using namespace std;
const int N = 2007;
ll n, pos[N], p, q, f[N][N];
bool Check(ll w)
{
int k = 1, l;
f[0][0] = 0;
for(int j = 1; j <= n; ++j) {
while(pos[j] - pos[k] >= 2 * w) ++k;
f[0][j] = f[0][k - 1] + 1;
}
for(int i = 1; i <= p; ++i) {
k = l = 1; f[i][0] = 0;
for(int j = 1; j <= n; ++j) {
while(pos[j] - pos[k] >= 2 * w) ++k;
while(pos[j] - pos[l] >= w) ++l;
f[i][j] = min({f[i][k - 1] + 1, f[i - 1][j], f[i - 1][l - 1]});
}
}
return f[p][n] <= q;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if(fopen("test.inp", "r")) {
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout);
}
cin >> n >> p >> q;
for(int i = 1; i <= n; ++i) cin >> pos[i];
if(p + q >= n) return cout << 1, 0;
sort(pos + 1, pos + n + 1);
ll l = 1, h = (ll)1e9;
while(l <= h) {
ll mid = (l + h) >> 1;
if(Check(mid)) h = mid - 1;
else l = mid + 1;
}
cout << l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |