# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
484465 | hoanghq2004 | Building Bridges (CEOI17_building) | C++14 | 3096 ms | 2536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int Nmax = 1e5 + 10;
int n, h[Nmax], s[Nmax];
long long f[Nmax];
int main() {
ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> h[i];
for (int i = 1; i <= n; ++i) cin >> s[i];
for (int i = 1; i <= n; ++i) s[i] += s[i - 1];
for (int i = 2; i <= n; ++i) {
f[i] = 1e18;
for (int j = 1; j < i; ++j) {
f[i] = min(f[i], f[j] + s[i - 1] - s[j] + 1LL * (h[i] - h[j]) * (h[i] - h[j]));
}
}
cout << f[n];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |