oj.uz

답안 #147166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147166 2019-08-28T08:38:12 Z MvC Building Bridges (CEOI17_building) C++11
0 / 100
 104 ms 4292 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,j,t,k;
ll h[nmax],f[2][nmax],p[nmax],w[nmax],x,rs=llinf;
void rec(int l,int r,int opl,int opr)
{
	if(l>r)return;
	int mid=(l+r)/2,bst=0;
	ll x;
	f[1][mid]=llinf;
	for(int i=opl;i<=min(mid-1,opr);i++)
	{
		if(f[0][i]==llinf)continue;
		x=f[0][i]+(h[mid]-h[i])*(h[mid]-h[i])+p[mid-1]-p[i];
		if(x<=f[1][mid])
		{
			f[1][mid]=x;
			bst=i;
		}
	}
	rec(l,mid-1,opl,bst);
	rec(mid+1,r,bst,opr);
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)cin>>h[i];
	for(i=1;i<=n;i++)
	{
		cin>>w[i];
		p[i]=p[i-1]+w[i];
	}
	for(i=1;i<=n;i++)f[0][i]=llinf;
	f[0][1]=0;
	if(n<=1000)k=n;
	else k=20;
	for(i=2;i<=k;i++)
	{
		rec(i,n,i-1,n-1);
		rs=min(rs,f[1][n]);
		for(j=1;j<=n;j++)
		{
			f[0][j]=f[1][j];
		}
	}
	cout<<rs<<endl;
	return 0;
}

Compilation message

building.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
building.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 4292 KB Output is correct
2 Incorrect 103 ms 4216 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -