#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, nSmall, nBig;
const int MAX = 2e3 + 5;
int a[MAX];
struct MonotonicQueue: deque<pair<int, int>>{
void push(int x, int i){
while (!empty() && back().first > x) pop_back();
push_back({x, i});
}
void pop(int i){
if(!empty() && front().second == i) pop_front();
}
int get_front(){
return front().first;
}
int get_back(){
return back().first;
}
};
void Whisper(){
cin >> nArr >> nSmall >> nBig;
for (int i = 1; i <= nArr; ++i) cin >> a[i];
if (nSmall + nBig > nArr) return void(cout << 1);
sort(a + 1, a + nArr + 1);
auto check = [&](int w){
//dp(i, j) số máy ảnh ảnh lớn tối thiểu cần sử dụng xét đến i
//và đã sử dụng j máy ảnh nhỏ
vector<vector<int>> dp(nArr + 1, vector<int>(nSmall + 1, INF));
for (int v = 0; v <= nSmall; ++v) dp[0][v] = 0;
for (int v = 0; v <= nSmall; ++v){
MonotonicQueue light, heavy;
if(v > 0)
light.push(dp[0][v - 1], 0);
heavy.push(dp[0][v], 0);
for (int i = 1; i <= nArr; ++i){
if(v > 0)
minimize(dp[i][v], dp[i - 1][v - 1]);
minimize(dp[i][v], dp[i - 1][v] + 1);
while (!light.empty() && a[i] - a[light.front().second + 1] + 1 > w) light.pop_front();
while (!heavy.empty() && a[i] - a[heavy.front().second + 1] + 1 > 2 * w) heavy.pop_front();
if(!light.empty()) minimize(dp[i][v], light.get_front());
if(!heavy.empty()) minimize(dp[i][v], heavy.get_front() + 1);
if(v > 0)
light.push(dp[i][v - 1], i);
heavy.push(dp[i][v], i);
}
}
int ans = INF;
for (int i = 0; i <= nSmall; ++i){
minimize(ans, dp[nArr][i]);
}
return (ans <= nBig);
};
int l = 1, r = 1e9;
int ans = -1;
while (l <= r){
int mid = (l + r) >> 1;
if(check(mid)) r = mid - 1, ans = mid;
else l = mid + 1;
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
348 KB |
Output is correct |
11 |
Correct |
4 ms |
348 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
604 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
392 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
392 KB |
Output is correct |
7 |
Correct |
21 ms |
848 KB |
Output is correct |
8 |
Correct |
157 ms |
2552 KB |
Output is correct |
9 |
Correct |
995 ms |
12416 KB |
Output is correct |
10 |
Execution timed out |
1045 ms |
30300 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |