#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> h(n), w(n);
for (int &i : h) cin >> i;
for (int &i : w) cin >> i;
vector<ll> dp(n, inf);
dp[0] = -w[0];
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
dp[i] = min(dp[i], dp[j] + 1LL * (h[i] - h[j]) * (h[i] - h[j]) - w[i]);
}
}
for (int i : w) dp[n - 1] += i;
cout << dp[n - 1];
return 6/22;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3052 ms |
2904 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Execution timed out |
3052 ms |
2904 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |