#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ld, int>;
#define f first
#define s second
bool operator < (pll x, pll y){
if (x.f == y.f){
return x.s < y.s;
}
if (x.f > y.f) return 1;
return 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, d, t; cin>>n>>d>>t;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++){
cin>>a[i];
}
vector<vector<int>> h(n + 1, vector<int>(n + 1));
for (int i = 1; i <= n; i++){
int mx = 0, cnt = 0;
for (int j = i; j <= n; j++){
if (a[j] <= t){
int m = t - a[j];
mx = max(mx, j + m);
}
cnt += (j <= mx);
h[i][j] = cnt;
}
}
auto solve = [&](ld m){
pll dp[n + 1];
for (int i = 1; i <= n; i++){
dp[i] = {h[1][i], 0};
for (int j = 1; j < i; j++){
// [1, j] | [j + 1, i]
dp[i] = min(dp[i], {dp[j].f + h[j + 1][i] + m, dp[j].s + 1});
}
}
return dp[n];
};
ld l = 0, r = n;
int tt = 30;
while (tt--){
ld m = (l + r) / 2;
auto [v, k] = solve(m);
if (k > d){
l = m;
}
else {
r = m;
}
}
auto [v, k] = solve(l);
cout<<round(v - l * d)<<"\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
14 ms |
1116 KB |
Output is correct |
3 |
Correct |
17 ms |
1144 KB |
Output is correct |
4 |
Correct |
24 ms |
1444 KB |
Output is correct |
5 |
Correct |
24 ms |
1372 KB |
Output is correct |
6 |
Correct |
20 ms |
1368 KB |
Output is correct |
7 |
Correct |
21 ms |
1468 KB |
Output is correct |
8 |
Correct |
21 ms |
1372 KB |
Output is correct |
9 |
Correct |
21 ms |
1372 KB |
Output is correct |
10 |
Correct |
21 ms |
1372 KB |
Output is correct |
11 |
Correct |
22 ms |
1372 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
318 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
14 ms |
1116 KB |
Output is correct |
3 |
Correct |
17 ms |
1144 KB |
Output is correct |
4 |
Correct |
24 ms |
1444 KB |
Output is correct |
5 |
Correct |
24 ms |
1372 KB |
Output is correct |
6 |
Correct |
20 ms |
1368 KB |
Output is correct |
7 |
Correct |
21 ms |
1468 KB |
Output is correct |
8 |
Correct |
21 ms |
1372 KB |
Output is correct |
9 |
Correct |
21 ms |
1372 KB |
Output is correct |
10 |
Correct |
21 ms |
1372 KB |
Output is correct |
11 |
Correct |
22 ms |
1372 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
1116 KB |
Output is correct |
14 |
Correct |
15 ms |
1112 KB |
Output is correct |
15 |
Correct |
22 ms |
1372 KB |
Output is correct |
16 |
Correct |
22 ms |
1372 KB |
Output is correct |
17 |
Correct |
20 ms |
1372 KB |
Output is correct |
18 |
Correct |
21 ms |
1372 KB |
Output is correct |
19 |
Correct |
21 ms |
1368 KB |
Output is correct |
20 |
Correct |
22 ms |
1372 KB |
Output is correct |
21 |
Correct |
21 ms |
1472 KB |
Output is correct |
22 |
Correct |
21 ms |
1372 KB |
Output is correct |
23 |
Execution timed out |
2052 ms |
63324 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Runtime error |
203 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
14 ms |
1116 KB |
Output is correct |
3 |
Correct |
17 ms |
1144 KB |
Output is correct |
4 |
Correct |
24 ms |
1444 KB |
Output is correct |
5 |
Correct |
24 ms |
1372 KB |
Output is correct |
6 |
Correct |
20 ms |
1368 KB |
Output is correct |
7 |
Correct |
21 ms |
1468 KB |
Output is correct |
8 |
Correct |
21 ms |
1372 KB |
Output is correct |
9 |
Correct |
21 ms |
1372 KB |
Output is correct |
10 |
Correct |
21 ms |
1372 KB |
Output is correct |
11 |
Correct |
22 ms |
1372 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
14 ms |
1116 KB |
Output is correct |
14 |
Correct |
15 ms |
1112 KB |
Output is correct |
15 |
Correct |
22 ms |
1372 KB |
Output is correct |
16 |
Correct |
22 ms |
1372 KB |
Output is correct |
17 |
Correct |
20 ms |
1372 KB |
Output is correct |
18 |
Correct |
21 ms |
1372 KB |
Output is correct |
19 |
Correct |
21 ms |
1368 KB |
Output is correct |
20 |
Correct |
22 ms |
1372 KB |
Output is correct |
21 |
Correct |
21 ms |
1472 KB |
Output is correct |
22 |
Correct |
21 ms |
1372 KB |
Output is correct |
23 |
Execution timed out |
2052 ms |
63324 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
14 ms |
1116 KB |
Output is correct |
3 |
Correct |
17 ms |
1144 KB |
Output is correct |
4 |
Correct |
24 ms |
1444 KB |
Output is correct |
5 |
Correct |
24 ms |
1372 KB |
Output is correct |
6 |
Correct |
20 ms |
1368 KB |
Output is correct |
7 |
Correct |
21 ms |
1468 KB |
Output is correct |
8 |
Correct |
21 ms |
1372 KB |
Output is correct |
9 |
Correct |
21 ms |
1372 KB |
Output is correct |
10 |
Correct |
21 ms |
1372 KB |
Output is correct |
11 |
Correct |
22 ms |
1372 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Runtime error |
318 ms |
524288 KB |
Execution killed with signal 9 |
14 |
Halted |
0 ms |
0 KB |
- |