# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934309 | Jawad_Akbar_JJ | Building Bridges (CEOI17_building) | C++17 | 287 ms | 11724 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 <iostream>
using namespace std;
#define int long long
const int N = 1e6 + 500;
int dp[N];
int h[N];
int pre[N];
bool seen[N];
int val[N];
int dist(int i,int j){
return (h[i] - h[j]) * (h[i] - h[j]);
}
int point(int i){
return pre[i] - pre[i-1];
}
void sub1(int n){
dp[1] = pre[n];
for (int i=2;i<=n;i++){
dp[i] = 1e17;
for (int j=1;j<i;j++)
dp[i] = min(dp[i],dp[j] + dist(i,j) - point(i));
}
cout<<dp[n]<<endl;
exit(0);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |