#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int n, l, r;
vector<int> a;
bool poss(int x) {
queue<int> q;
q.push(-1);
int i = 0;
while(i < n && !q.empty()) {
int v = q.front();
if (i - v >= l) {
// cout << i << " " << v << " " << a[i] << " " << a[v+1] << "\n";
if (i - v <= r && a[i] - a[v+1] <= x) {
q.push(i);
i++;
} else {
q.pop();
}
} else {
i++;
}
} cerr << "\n";
return !q.empty() && q.back() == n-1;
}
int bsearch() {
int L = 0, R = 1e7, ans = R;
while(L <= R) {
int mid = (L + R) / 2;
if (poss(mid)) {
ans = mid;
R = mid - 1;
} else {
L = mid + 1;
}
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> l >> r;
a.resize(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = bsearch();
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
17 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
249 ms |
4308 KB |
Output is correct |
5 |
Correct |
230 ms |
4332 KB |
Output is correct |
6 |
Correct |
25 ms |
748 KB |
Output is correct |
7 |
Correct |
203 ms |
4000 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 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 |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
17 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
249 ms |
4308 KB |
Output is correct |
5 |
Correct |
230 ms |
4332 KB |
Output is correct |
6 |
Correct |
25 ms |
748 KB |
Output is correct |
7 |
Correct |
203 ms |
4000 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
1 ms |
364 KB |
Output is correct |
17 |
Correct |
1 ms |
364 KB |
Output is correct |
18 |
Correct |
1 ms |
364 KB |
Output is correct |
19 |
Correct |
1 ms |
364 KB |
Output is correct |
20 |
Correct |
1 ms |
364 KB |
Output is correct |
21 |
Correct |
10 ms |
620 KB |
Output is correct |
22 |
Correct |
13 ms |
620 KB |
Output is correct |
23 |
Correct |
20 ms |
876 KB |
Output is correct |
24 |
Correct |
26 ms |
1280 KB |
Output is correct |
25 |
Correct |
169 ms |
5240 KB |
Output is correct |
26 |
Correct |
275 ms |
8976 KB |
Output is correct |
27 |
Correct |
32 ms |
1260 KB |
Output is correct |
28 |
Correct |
20 ms |
876 KB |
Output is correct |
29 |
Correct |
1 ms |
364 KB |
Output is correct |
30 |
Correct |
425 ms |
10988 KB |
Output is correct |
31 |
Correct |
429 ms |
10988 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
17 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
364 KB |
Output is correct |
4 |
Correct |
249 ms |
4308 KB |
Output is correct |
5 |
Correct |
230 ms |
4332 KB |
Output is correct |
6 |
Correct |
25 ms |
748 KB |
Output is correct |
7 |
Correct |
203 ms |
4000 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
10 ms |
620 KB |
Output is correct |
12 |
Correct |
13 ms |
620 KB |
Output is correct |
13 |
Correct |
20 ms |
876 KB |
Output is correct |
14 |
Correct |
26 ms |
1280 KB |
Output is correct |
15 |
Correct |
169 ms |
5240 KB |
Output is correct |
16 |
Correct |
275 ms |
8976 KB |
Output is correct |
17 |
Correct |
32 ms |
1260 KB |
Output is correct |
18 |
Correct |
20 ms |
876 KB |
Output is correct |
19 |
Correct |
1 ms |
364 KB |
Output is correct |
20 |
Correct |
425 ms |
10988 KB |
Output is correct |
21 |
Correct |
429 ms |
10988 KB |
Output is correct |
22 |
Correct |
1 ms |
364 KB |
Output is correct |
23 |
Correct |
1 ms |
364 KB |
Output is correct |
24 |
Correct |
1 ms |
364 KB |
Output is correct |
25 |
Correct |
1 ms |
364 KB |
Output is correct |
26 |
Correct |
1 ms |
364 KB |
Output is correct |
27 |
Correct |
1 ms |
364 KB |
Output is correct |
28 |
Correct |
1 ms |
364 KB |
Output is correct |
29 |
Correct |
1 ms |
364 KB |
Output is correct |
30 |
Correct |
1 ms |
364 KB |
Output is correct |
31 |
Correct |
1 ms |
364 KB |
Output is correct |
32 |
Correct |
15 ms |
748 KB |
Output is correct |
33 |
Correct |
184 ms |
6240 KB |
Output is correct |
34 |
Correct |
168 ms |
5576 KB |
Output is correct |
35 |
Correct |
552 ms |
13140 KB |
Output is correct |
36 |
Correct |
293 ms |
13208 KB |
Output is correct |
37 |
Correct |
307 ms |
12908 KB |
Output is correct |
38 |
Correct |
222 ms |
6636 KB |
Output is correct |