oj.uz

Submission #80159

# Submission time Handle Problem Language Result Execution time Memory
80159 2018-10-19T08:41:32 Z aminra Building Bridges (CEOI17_building) C++14
30 / 100
 3000 ms 3760 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)1e6 + 7;
const int infint = (int)1e9;
const ll inf = 1e18;
ll n, h[MAXN], w[MAXN], dp[MAXN];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> h[i];
	for (int i = 0; i < n; i++)
		cin >> w[i];
	for (int i = 1; i < n; i++)
		w[i] += w[i - 1];
	dp[0] = 0;
	for (int i = 1; i < n; i++)
	{
		dp[i] = inf;
		for (int j = 0; j < i; j++)
			dp[i] = min(dp[i], dp[j] + (h[i] - h[j]) * (h[i] - h[j]) + w[i - 1] - w[j]);
	}
	cout << dp[n - 1];
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 4 ms 540 KB Output is correct
5 Correct 4 ms 596 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3046 ms 3760 KB Time limit exceeded
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 2 ms 508 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 4 ms 540 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Execution timed out 3046 ms 3760 KB Time limit exceeded
7 Halted 0 ms 0 KB -