제출 #46469

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46469		1Khan	Building Bridges (CEOI17_building)	C++14	0 / 100	3059 ms	5876 KiB

building

#include <bits/stdc++.h>

using namespace std;

#define Tupizm ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define ONE exit(0);
#define nl "\n"

#define fly return

#define ff first
#define ss second

#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()

#define pb push_back
#define ppb pop_back

typedef long long ll;
typedef double db;

const int N = 1e5 + 5;
const int M = 1e9 + 7;

int n, h[N], w[N];
ll ans = (ll)M;

void man(int t = 2, int p = 1, ll sum = 0){
    if(t >= n){
        sum += (ll)((h[t] - h[p]) * (h[t] - h[p]));
        ans = min(ans, sum);
        fly;
    }
    int q = t + 1;
    man(q, p, sum + w[t]);
    int w = t + 1;
    int e = t;
    man(w, e, sum + (ll)((h[t] - h[p]) * (h[t] - h[p])));
}
int main(){
      
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> h[i];
    }
    for(int i = 1; i <= n; ++i){
        cin >> w[i];
    }
    man();
    cout << ans << nl;
    ONE
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 30
• Subtask 3: 0 / 40