Submission #988364

#TimeUsernameProblemLanguageResultExecution timeMemory
988364VMaksimoski008Building Bridges (CEOI17_building)C++17
30 / 100
3013 ms4428 KiB
#include <bits/stdc++.h> #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; int32_t main() { int n; cin >> n; vector<ll> h(n+1), w(n+1), pref(n+1); 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]; vector<ll> dp(n+1, 1e18); dp[1] = 0; for(int i=2; i<=n; i++) { for(int j=1; j<i; j++) { dp[i] = min(dp[i], dp[j] + (h[i] - h[j]) * (h[i] - h[j]) + pref[i] - pref[j] - w[i]); } } cout << dp[n] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...