# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
939035 | vjudge1 | Building Bridges (CEOI17_building) | C++17 | 3058 ms | 2788 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;
#define pb push_back
#define ff first
#define ss second
#define int long long
typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 3e5+50, inf = 1e18, mod = 1e9+7;
void solve(){
int n;
cin >> n;
int a[n], w[n];
for(int &i:a)cin >> i;
for(int &i:w)cin >> i;
int ans[n]{};
for(auto &i:ans)i = inf;
ans[0] = 0;
for(int i = 1; i < n; i++){
int sm = 0;
for(int j = i - 1; j >= 0; j--){
int df = a[i]-a[j];df*=df;
ans[i] = min(ans[i], ans[j] + sm + df);
sm += w[j];
}
}
//for(int i:ans)cout << i << ' ' ;
//cout << '\n';
cout << ans[n-1] << '\n';
}
main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int test = 1;
//cin >> test;
while(test--){
solve();
}
}
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... |