# include <bits/stdc++.h>
# define ll long long
using namespace std;
int N, P, Q;
vector<int> arr;
int mn[2001][2001];
int edge[2][2001];
bool cek(int a) {
// set edge nya dulu
for(int i=0;i<N;i++) {
int T = arr[i] + a - 1;
edge[0][i] = upper_bound(arr.begin(), arr.end(), T) - arr.begin();
T += a;
edge[1][i] = upper_bound(arr.begin(), arr.end(), T) - arr.begin();
// if(a == 4) cout<<i<<" "<<edge[0][i]<<" "<<edge[1][i]<<endl;
}
for(int d=0;d<=N;d++) {
for(int a=0;a<=P;a++) mn[d][a] = 1e9;
}
priority_queue< pair<int, pair<int, int> > > PQ;
PQ.push(make_pair(0, make_pair(0, 0)));
while(!PQ.empty()) {
int x, y, z;
x = PQ.top().second.second;
y = PQ.top().second.first;
z = PQ.top().first;
PQ.pop();
if(-z > Q) continue;
if(mn[x][-y] != 1e9) continue;
// if(a == 1) cout<<x<<" "<<y<<" "<<z<<endl;
mn[x][-y] = z;
if(x == N) return 1;
PQ.push(make_pair(z, make_pair(y-1, edge[0][x])));
PQ.push(make_pair(z-1, make_pair(y, edge[1][x])));
}
return 0;
}
int main() {
scanf("%d %d %d", &N, &P, &Q);
arr.resize(N);
for(int i=0;i<N;i++) scanf("%d", &arr[i]);
sort(arr.begin(), arr.end());
if(P + Q >= N) {
printf("1\n");
return 0;
}
// cout<<cek(4)<<endl;
int l = 1, r = 1e9, ans = -1;
while(l <= r) {
int mid = (l + r) / 2;
if(cek(mid)) {
ans = mid;
r = mid - 1;
} else l = mid + 1;
}
printf("%d\n", ans);
}
Compilation message
watching.cpp: In function 'int main()':
watching.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
47 | scanf("%d %d %d", &N, &P, &Q);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
watching.cpp:49:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
49 | for(int i=0;i<N;i++) scanf("%d", &arr[i]);
| ~~~~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
724 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
724 KB |
Output is correct |
8 |
Correct |
1 ms |
688 KB |
Output is correct |
9 |
Correct |
2 ms |
692 KB |
Output is correct |
10 |
Correct |
3 ms |
816 KB |
Output is correct |
11 |
Correct |
5 ms |
724 KB |
Output is correct |
12 |
Correct |
6 ms |
684 KB |
Output is correct |
13 |
Correct |
1 ms |
696 KB |
Output is correct |
14 |
Correct |
1 ms |
684 KB |
Output is correct |
15 |
Correct |
1 ms |
768 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
8276 KB |
Output is correct |
2 |
Correct |
1 ms |
260 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
232 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
10 ms |
8468 KB |
Output is correct |
8 |
Correct |
360 ms |
9340 KB |
Output is correct |
9 |
Correct |
552 ms |
14288 KB |
Output is correct |
10 |
Correct |
204 ms |
16096 KB |
Output is correct |
11 |
Correct |
359 ms |
9064 KB |
Output is correct |
12 |
Execution timed out |
1063 ms |
16016 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |