#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int maxN = 1e6+10;
const int inf = 2147000000;
int n, mini, maxi;
int a[maxN];
int dp[maxN];
bool test(int v){
fill(dp, dp+maxN, 0);
dp[0]=1;
int i, j;
for(i = 0; i < n; i++){
if(i>1)dp[i]+=dp[i-1];
if(dp[i]<=0)continue;
j=i;
while(j<n&&a[j]-a[i]<=v)j++;
if(i+mini<=min(i+maxi, j)){
dp[i+mini]++;
dp[min(i+maxi, j)+1]--;
}
}
dp[n]+=dp[n-1];
return dp[n]>0;
}
int solve(){
int ans=inf;
int l = 0, h = inf;
while(l<h){
int mid = l+((h-l)/2);
//cout<<l<<" "<<mid<<" "<<h<<" "<<test(mid)<<endl;
if(test(mid))h=mid;
else l=mid+1;
}
return l;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(nullptr);
cin>>n>>mini>>maxi;
for(int i = 0; i < n; i++)cin>>a[i];
sort(a, a+n);
cout<<solve();
return 0;
}
Compilation message
plaukimo_varzybos.cpp: In function 'int solve()':
plaukimo_varzybos.cpp:38:9: warning: unused variable 'ans' [-Wunused-variable]
38 | int ans=inf;
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4172 KB |
Output is correct |
2 |
Correct |
1032 ms |
5296 KB |
Output is correct |
3 |
Correct |
140 ms |
4316 KB |
Output is correct |
4 |
Execution timed out |
2033 ms |
14808 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4164 KB |
Output is correct |
2 |
Correct |
5 ms |
4160 KB |
Output is correct |
3 |
Correct |
5 ms |
4172 KB |
Output is correct |
4 |
Correct |
5 ms |
4160 KB |
Output is correct |
5 |
Correct |
5 ms |
4228 KB |
Output is correct |
6 |
Correct |
5 ms |
4172 KB |
Output is correct |
7 |
Correct |
5 ms |
4172 KB |
Output is correct |
8 |
Correct |
5 ms |
4156 KB |
Output is correct |
9 |
Correct |
5 ms |
4160 KB |
Output is correct |
10 |
Correct |
7 ms |
4156 KB |
Output is correct |
11 |
Correct |
4 ms |
4172 KB |
Output is correct |
12 |
Correct |
5 ms |
4232 KB |
Output is correct |
13 |
Correct |
4 ms |
4172 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4172 KB |
Output is correct |
2 |
Correct |
1032 ms |
5296 KB |
Output is correct |
3 |
Correct |
140 ms |
4316 KB |
Output is correct |
4 |
Execution timed out |
2033 ms |
14808 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
4172 KB |
Output is correct |
2 |
Correct |
1032 ms |
5296 KB |
Output is correct |
3 |
Correct |
140 ms |
4316 KB |
Output is correct |
4 |
Execution timed out |
2033 ms |
14808 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |