#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nax=2e3+3;
int n,p,q;
ll a[nax];
int dp[nax][nax];
bool check(ll w){
for(int i=0;i<n;i++){
int ppp=0;
while(i-ppp>=0&&a[i]-w+1LL<=a[i-ppp])ppp++;
int pp=0;
while(i-pp>=0&&a[i]-2LL*w+1<=a[i-pp])pp++;
for(int j=0;j<=q;j++){
if(i-ppp<0)dp[i][j]=1;
else dp[i][j]=dp[i-ppp][j]+1;
if(j!=0){
if(i-pp<0)dp[i][j]=0;
else dp[i][j]=min(dp[i][j],dp[i-pp][j-1]);
}
}
}
return dp[n-1][q]<=p;
}
int main(){
cin>>n>>p>>q;
if(p+q>=n){
cout<<1<<endl;
return 0;
}
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
ll x=-1;
for(ll b=2e9;b>=1LL;b/=2LL)
while(!check(x+b))x+=b;
cout<<x+1<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
748 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
748 KB |
Output is correct |
8 |
Correct |
1 ms |
748 KB |
Output is correct |
9 |
Correct |
1 ms |
748 KB |
Output is correct |
10 |
Correct |
1 ms |
748 KB |
Output is correct |
11 |
Correct |
1 ms |
748 KB |
Output is correct |
12 |
Correct |
1 ms |
748 KB |
Output is correct |
13 |
Correct |
1 ms |
748 KB |
Output is correct |
14 |
Correct |
1 ms |
748 KB |
Output is correct |
15 |
Correct |
1 ms |
748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
118 ms |
8424 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
47 ms |
8428 KB |
Output is correct |
8 |
Correct |
133 ms |
14464 KB |
Output is correct |
9 |
Correct |
44 ms |
9324 KB |
Output is correct |
10 |
Incorrect |
33 ms |
9068 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |