# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96073 | Alexa2001 | Watching (JOI13_watching) | C++17 | 2 ms | 376 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>
using namespace std;
const int Nmax = 2005, inf = 1e9;
int N, P, Q, n;
int A[Nmax], a[Nmax], dp[Nmax][Nmax];
bool check(int W)
{
int i, j = 1, k = 1, it;
for(i=1; i<=N; ++i)
{
while(A[j] + W - 1 < A[i]) ++j;
while(A[k] + 2*W - 1 < A[i]) ++k;
for(it=0; it<=i && it<=P; ++it)
dp[i][it] = min( (it != 0 ? dp[j-1][it-1] : inf), dp[k-1][it] + 1);
for(; it<=P; ++it) dp[i][it] = inf;
}
return (dp[N][P] <= Q);
}
int main()
{
freopen("input", "r", stdin);
int i;
cin >> n >> P >> Q;
for(i=1; i<=n; ++i) cin >> a[i];
sort(a+1, a+n+1);
for(i=1; i<=n; ++i)
if(a[i] != a[i-1]) A[++N] = a[i];
P = min(P, N); Q = min(Q, N);
int st = 0, dr = N, mid;
while(st <= dr)
{
mid = (st+dr)/2;
if(check(mid)) dr = mid-1;
else st = mid+1;
}
cout << st << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |