# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
228359 |
2020-04-30T18:46:06 Z |
Nayna |
Watching (JOI13_watching) |
C++14 |
|
1000 ms |
31744 KB |
#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e3+5;
typedef long long ll;
const ll inf = 1e16;
ll arr[mxn];
ll dp[mxn][mxn];
ll n, P, Q;
bool solve(ll w)
{
for(int i = 0; i <= n; i++)
for(int r = 0; r <= n; r++) dp[i][r] = inf;
dp[0][0] = 0;
for(int i = 1; i <= n; i++)
{
for(int r = 0; r <= P; r++)
{
int x = upper_bound(arr+1, arr+n+1, arr[i]-w)-arr-1;
int y = upper_bound(arr+1, arr+n+1, arr[i]-w-w)-arr-1;
if(r) dp[i][r] = min(dp[i][r], dp[x][r-1]);
dp[i][r] = min(dp[i][r], dp[y][r]+1);
}
}
for(int i = 0; i <= n; i++)
if(dp[n][i]<=Q) return true;
return false;
}
int main()
{
cin >> n >> P >> Q;
P = min(n, P);
Q = min(n, Q);
for(int i = 1; i <= n; i++) cin >> arr[i];
sort(arr+1, arr+n+1);
ll lo = 1, hi = 1e9+5, ans = inf;
while(lo<=hi)
{
ll mid = (lo+hi)>>1;
if(solve(mid))
{
hi = mid-1;
ans = min(ans, mid);
}
else lo = mid+1;
}
cout << ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
896 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
12 ms |
896 KB |
Output is correct |
5 |
Correct |
6 ms |
896 KB |
Output is correct |
6 |
Correct |
12 ms |
896 KB |
Output is correct |
7 |
Correct |
5 ms |
768 KB |
Output is correct |
8 |
Correct |
5 ms |
768 KB |
Output is correct |
9 |
Correct |
6 ms |
768 KB |
Output is correct |
10 |
Correct |
6 ms |
768 KB |
Output is correct |
11 |
Correct |
9 ms |
768 KB |
Output is correct |
12 |
Correct |
8 ms |
768 KB |
Output is correct |
13 |
Correct |
5 ms |
768 KB |
Output is correct |
14 |
Correct |
6 ms |
768 KB |
Output is correct |
15 |
Correct |
5 ms |
768 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
138 ms |
31744 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Execution timed out |
1094 ms |
31744 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |