# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100381 | shafinalam | Building Bridges (CEOI17_building) | C++14 | 3089 ms | 8320 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 mx = 1e5+5;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<int,pii>piii;
#define sf scanf
#define pf printf
#define input freopen("input.txt","r",stdin)
#define output freopen("output.txt","w",stdout)
#define inf 1e16
#define ff first
#define ss second
#define MP make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define printcase(cases) printf("Case %d:", cases);
#define Unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define FAST ios_base::sync_with_stdio(0);cout.tie(0)
#define endl printf("\n")
#define __lcm(a, b) ((a*b)/__gcd(a, b))
int Set(int N,int pos)
{
return N=N | (1<<pos);
}
int reset(int N,int pos)
{
return N= N & ~(1<<pos);
}
bool check(int N,int pos)
{
return (bool)(N & (1<<pos));
}
ll dp[mx];
ll arr[mx];
ll cost[mx];
int n;
ll solve(int pos)
{
if(pos>=n-1) return 0;
if(dp[pos]!=-1) return dp[pos];
ll ret = inf, x = 0;
for(int i = pos+1; i < n; i++)
{
ll tmp = (arr[pos]-arr[i])*(arr[pos]-arr[i]);
ret = min(ret, solve(i)+x+tmp);
x+=cost[i];
}
return dp[pos] = ret;
}
int main()
{
sf("%d", &n);
for(int i = 0; i < n; i++) sf("%lld", &arr[i]);
for(int i = 0; i < n; i++) sf("%lld", &cost[i]);
memset(dp, -1, sizeof dp);
ll ans = solve(0);
pf("%lld\n", ans);
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... |