Submission #582060

#TimeUsernameProblemLanguageResultExecution timeMemory
582060600MihneaBuilding Bridges (CEOI17_building)C++17
30 / 100
3073 ms2552 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = (int) 1e5 + 7;
const ll INF = (ll) 1e18 + 7;
int n;
ll h[N];
ll sum[N];
ll dp[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    h[i] = x;
  }
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    sum[i] = sum[i - 1] + x;
  }

  dp[1] = 0;
  for (int i = 2; i <= n; i++) {
    dp[i] = INF;
  }

  for (int r = 2; r <= n; r++) {
    for (int l = 1; l < r; l++) {
      dp[r] = min(dp[r], (dp[l] + h[l] * h[l] - sum[l]) - h[r] * (2 * h[l]));
    }
    dp[r] += h[r] * h[r] + sum[r - 1];
  }

  cout << dp[n] << "\n";

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...