oj.uz

Submission #147163

# Submission time Handle Problem Language Result Execution time Memory
147163 2019-08-28T08:16:56 Z MvC Building Bridges (CEOI17_building) C++11
30 / 100
 530 ms 7564 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=1e3+50;
const int mod=1e9+7;
using namespace std;
int n,i,j,t;
ll h[nmax],f[nmax][nmax],p[nmax],w[nmax],x,rs=llinf;
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[1][i]=llinf;
	f[1][1]=0;
	for(i=2;i<=n;i++)
	{
		for(j=i;j<=n;j++)
		{
			f[i][j]=llinf;
			for(t=i-1;t<j;t++)
			{
				if(f[i-1][t]==llinf)continue;
				if(j-1>=t)x=p[j-1]-p[t];
				else x=0;
				f[i][j]=min(f[i][j],f[i-1][t]+(h[j]-h[t])*(h[j]-h[t])+x);
			}
		}
	}
	for(i=2;i<=n;i++)rs=min(rs,f[i][n]);
	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
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 523 ms 7564 KB Output is correct
5 Correct 530 ms 7472 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 3 ms 760 KB Output is correct
4 Correct 523 ms 7564 KB Output is correct
5 Correct 530 ms 7472 KB Output is correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Halted 0 ms 0 KB -