# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34576 | sinhriv | Watching (JOI13_watching) | C++14 | 809 ms | 20980 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 N = 2202;
int n, p, q;
int a[N];
int f[N][N];
int one[N];
int two[N];
int main(){
if(fopen("1.inp", "r")){
freopen("1.inp", "r", stdin);
}
scanf("%d%d%d", &n, &p, &q);
for(int i = 1; i <= n; ++i){
scanf("%d", a + i);
}
p = min(p, n);
q = min(q, n);
sort(a + 1, a + n + 1);
int low = 1, high = 1e9, ans = 1e9;
while(low <= high){
int w = (low + high) >> 1;
for(int i = 0; i <= n; ++i){
for(int j = 0; j <= n; ++j){
f[i][j] = 1e9;
}
}
f[0][0] = 0;
bool ok = false, debug = false;
int pterOne = 0, pterTwo = 0;
for(int i = 1; i <= n; ++i){
while(a[i] - a[pterOne + 1] + 1 > w) ++pterOne;
while(a[i] - a[pterTwo + 1] + 1 > w + w) ++pterTwo;
one[i] = pterOne;
two[i] = pterTwo;
}
for(int j = 0; j <= p; ++j){
for(int i = 1; i <= n; ++i){
if(j > 0) f[i][j] = min(f[i][j], f[one[i]][j - 1]);
f[i][j] = min(f[i][j], f[two[i]][j] + 1);
if(i == n && f[i][j] <= q){
ok = true;
break;
}
}
if(ok) break;
}
if(ok == false){
low = w + 1;
}
else{
ans = w;
high = w - 1;
}
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |