제출 #159168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
159168		nvmdava	Building Bridges (CEOI17_building)	C++17	0 / 100	27 ms	3704 KiB

building

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 100005

ll h[N], w[N];
ll dp[N];

inline ll sqr(ll a){
	return a * a;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n;
	cin>>n;

	for(int i = 1; i <= n; i++)
		cin>>h[i];
	for(int i = 1; i <= n; i++){
		cin>>w[i];
		w[i] += w[i - 1];
	}
	memset(dp, 0x3f3f, sizeof dp);
	dp[1] = 0;
	vector<int> d, u;

	for(int i = 1; i <= n; i++){
		while(!d.empty() && h[d.back()] < h[i])
			d.pop_back();
		while(!u.empty() && h[u.back()] > h[i])
			u.pop_back();

		if(!d.empty())
			dp[i] = min(dp[i], dp[d.back()] + sqr(h[i] - h[d.back()]) + w[i - 1] - w[d.back()]);
		if(!u.empty())
			dp[i] = min(dp[i], dp[u.back()] + sqr(h[i] - h[u.back()]) + w[i - 1] - w[u.back()]);

		while(!u.empty() && h[u.back()] == h[i])
			u.pop_back();
		while(!d.empty() && h[d.back()] == h[i])
			d.pop_back();

		u.push_back(i);
		d.push_back(i);
	}

	cout<<dp[n];
}

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