#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll inf=1e18;
ll arr[5005][5005];
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
std::vector<int> R) {
ll n=H.size();
ll q=L.size();
vector<ll> ans;
for (int i=0;i<n;i++){
arr[i][i]=H[i];
for (int j=i-1;j>=0;j--){
arr[i][j]=max<ll>(arr[i][j+1],H[j]);
}
for (int j=i+1;j<n;j++){
arr[i][j]=max<ll>(arr[i][j-1],H[j]);
}
for (int j=1;j<n;j++){
arr[i][j]+=arr[i][j-1];
}
}
for (int i=0;i<q;i++){
ll tot=inf;
for (int j=L[i];j<=R[i];j++){
if (L[i]!=0) tot=min(tot,arr[j][R[i]]-arr[j][L[i]-1]);
else tot=min(tot,arr[j][R[i]]);
}
ans.emplace_back(tot);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
63 ms |
108428 KB |
Output is correct |
3 |
Correct |
45 ms |
108404 KB |
Output is correct |
4 |
Correct |
49 ms |
109392 KB |
Output is correct |
5 |
Correct |
45 ms |
108624 KB |
Output is correct |
6 |
Correct |
44 ms |
109196 KB |
Output is correct |
7 |
Correct |
45 ms |
108416 KB |
Output is correct |
8 |
Correct |
47 ms |
109140 KB |
Output is correct |
9 |
Correct |
45 ms |
108628 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
63 ms |
108428 KB |
Output is correct |
3 |
Correct |
45 ms |
108404 KB |
Output is correct |
4 |
Correct |
49 ms |
109392 KB |
Output is correct |
5 |
Correct |
45 ms |
108624 KB |
Output is correct |
6 |
Correct |
44 ms |
109196 KB |
Output is correct |
7 |
Correct |
45 ms |
108416 KB |
Output is correct |
8 |
Correct |
47 ms |
109140 KB |
Output is correct |
9 |
Correct |
45 ms |
108628 KB |
Output is correct |
10 |
Correct |
257 ms |
196428 KB |
Output is correct |
11 |
Correct |
344 ms |
196412 KB |
Output is correct |
12 |
Correct |
257 ms |
196632 KB |
Output is correct |
13 |
Correct |
332 ms |
196480 KB |
Output is correct |
14 |
Correct |
269 ms |
196944 KB |
Output is correct |
15 |
Correct |
302 ms |
196524 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Runtime error |
358 ms |
399584 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Runtime error |
358 ms |
399584 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
63 ms |
108428 KB |
Output is correct |
3 |
Correct |
45 ms |
108404 KB |
Output is correct |
4 |
Correct |
49 ms |
109392 KB |
Output is correct |
5 |
Correct |
45 ms |
108624 KB |
Output is correct |
6 |
Correct |
44 ms |
109196 KB |
Output is correct |
7 |
Correct |
45 ms |
108416 KB |
Output is correct |
8 |
Correct |
47 ms |
109140 KB |
Output is correct |
9 |
Correct |
45 ms |
108628 KB |
Output is correct |
10 |
Correct |
257 ms |
196428 KB |
Output is correct |
11 |
Correct |
344 ms |
196412 KB |
Output is correct |
12 |
Correct |
257 ms |
196632 KB |
Output is correct |
13 |
Correct |
332 ms |
196480 KB |
Output is correct |
14 |
Correct |
269 ms |
196944 KB |
Output is correct |
15 |
Correct |
302 ms |
196524 KB |
Output is correct |
16 |
Correct |
1 ms |
344 KB |
Output is correct |
17 |
Runtime error |
358 ms |
399584 KB |
Execution killed with signal 11 |
18 |
Halted |
0 ms |
0 KB |
- |