oj.uz

답안 #393128

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393128 2021-04-22T19:27:42 Z knightron0 Building Bridges (CEOI17_building) C++14
0 / 100
 3000 ms 3516 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
	int n;
	cin>>n;
	int a[n+3], b[n+3], sum = 0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}    
	for(int i= 1;i<=n;i++){
		cin>>b[i];
		sum += b[i];
	}
	int dp[n+3];
	dp[1] = 0;
	for(int i=2;i<=n;i++){
		dp[i] = INF;
		for(int j= 1;j<i;j++){
			dp[i] = min(-b[i]+dp[j]+((a[i]-a[j])*(a[i]-a[j])), dp[i]);
		}
	}
	cout<<sum+dp[n]<<endl;
    return 0;
}

Subtask #1
0 / 30.0

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

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3070 ms 3516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

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