oj.uz

Submission #819401

# Submission time Handle Problem Language Result Execution time Memory
819401 2023-08-10T10:27:36 Z borisAngelov Building Bridges (CEOI17_building) C++17
0 / 100
 3000 ms 4240 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 100005;
const long long inf = (1LL << 62);

int n;

long long h[maxn];
long long w[maxn];
long long pref[maxn];
long long dp[maxn];

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    cin >> n;

    for (int i = 1; i <= n; ++i)
    {
        cin >> h[i];
    }

    for (int i = 1; i <= n; ++i)
    {
        cin >> w[i];
        pref[i] = pref[i - 1] + w[i];
    }

    dp[1] = w[1];

    for (int i = 2; i <= n; ++i)
    {
        dp[i] = inf;

        for (int j = i - 1; j >= 1; --j)
        {
            dp[i] = min(dp[i], dp[j] + pref[i - 1] - pref[j] + (h[i] - h[j]) * (h[i] - h[j]));
        }
    }

    cout << dp[n] << endl;

    return 0;
}

/*
6
3 8 7 1 6 6
0 -1 9 1 2 0
*/

Subtask #1
0 / 30.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3065 ms 4240 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

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