#include <bits/stdc++.h>
using namespace std;
const int64_t INF = 1e18;
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int64_t> h(n+1), w(n+1);
for(int i = 1; i <= n; i++)
cin >> h[i];
for(int i = 1; i <= n; i++)
cin >> w[i];
vector<int64_t> pref(n+1, 0);
for(int i = 1; i <= n; i++)
pref[i] = pref[i-1] + w[i];
vector<int64_t> dp(n+1, INF);
dp[1] = 0;
for(int i = 1; i <= n; i++){
for(int j = 1; j < i; j++)
dp[i] = min(dp[i], dp[j] + (h[i] - h[j])*(h[i] - h[j]) + pref[i-1] - pref[j]);
}
cout << dp[n] << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
2 ms |
364 KB |
Output is correct |
5 |
Correct |
2 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3079 ms |
4480 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
2 ms |
364 KB |
Output is correct |
5 |
Correct |
2 ms |
364 KB |
Output is correct |
6 |
Execution timed out |
3079 ms |
4480 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |