#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e18;
const int mxN = 1e5 + 10;
const int mxM = 1e6 + 10;
int n;
int h[mxN], w[mxN];
int pref[mxN];
int dp[mxN];
int sqr(int x) {
return x * x;
}
int f(pair<int, int> a, int x) {
return a.first * x + a.second;
}
pair<int, int> line[mxM << 2];
void add_line(int id, int l, int r, pair<int, int> nw) {
int m = (l + r) / 2;
bool lef = f(nw, l) < f(line[id], l);
bool mid = f(nw, m) < f(line[id], m);
if(mid) {
swap(line[id], nw);
}
if(r - l == 1) {
return ;
} else if(lef != mid) {
add_line(id * 2, l, m, nw);
} else {
add_line(id * 2 + 1, m, r, nw);
}
}
int get(int id, int l, int r, int x) {
int m = (l + r) / 2;
if(r - l == 1) {
return f(line[id], x);
} else if(x < m) {
return min(f(line[id], x), get(id * 2, l, m, x));
} else {
return min(f(line[id], x), get(id * 2 + 1, m, r, x));
}
}
signed main() {
#define taskname ""
if(fopen(taskname".inp", "r")) {
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 1; i <= n; i ++) cin >> h[i];
for(int i = 1; i <= n; i ++) cin >> w[i];
for(int i = 1; i <= n; i ++) {
pref[i] = pref[i - 1] + w[i];
}
for(int i = 1; i <= (n << 2); i ++) {
line[i] = {1e12, inf};
}
dp[1] = 0;
add_line(1, 0, 1e6 + 1, make_pair(- 2 * h[1], sqr(h[1]) + dp[1] - pref[1]));
for(int i = 2; i <= n; i ++) {
dp[i] = get(1, 0, 1e6 + 1, h[i]) + sqr(h[i]) + pref[i - 1];
add_line(1, 0, 1e6 + 1, make_pair(- 2 * h[i], sqr(h[i]) + dp[i] - pref[i]));
}
cout << dp[n] << "\n";
return 0;
}
Compilation message
building.cpp: In function 'int main()':
building.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
57 | freopen(taskname".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
building.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
58 | freopen(taskname".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
38 ms |
9896 KB |
Output is correct |
2 |
Correct |
37 ms |
9924 KB |
Output is correct |
3 |
Correct |
37 ms |
9916 KB |
Output is correct |
4 |
Correct |
35 ms |
9780 KB |
Output is correct |
5 |
Incorrect |
34 ms |
10904 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
468 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Incorrect |
1 ms |
724 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |