# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310757 | ly20 | Building Bridges (CEOI17_building) | C++17 | 3056 ms | 3712 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>
using namespace std;
const int MAXN = 112345;
long long dp[MAXN];
long long sp[MAXN], h[MAXN];
int main() {
int n;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
scanf("%lld", &h[i]);
}
for(int i = 0; i < n; i++) {
dp[i] = 1123456789012345678;
int a;
scanf("%d", &a);
if(i == 0) sp[i] = a;
else sp[i] = sp[i - 1] + a;
}
dp[0] = 0;
for(int i = 1; i < n; i++) {
for(int j = i - 1; j >= 0; j--) {
dp[i] = min(dp[i], dp[j] + sp[i - 1] - sp[j] + (h[i] - h[j]) * (h[i] - h[j]));
}
}
printf("%lld\n", dp[n - 1]);
return 0;
}
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... |