답안 #779348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779348 2023-07-11T11:00:58 Z danikoynov Building Bridges (CEOI17_building) C++14
30 / 100
3000 ms 4112 KB
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const ll inf = 1e18;
const int maxn = 1e5 + 10;

int n;
ll h[maxn], w[maxn], pref[maxn], dp[maxn];
void solve()
{
    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] = 0;
    for (int i = 2; i <= n; i ++)
    {
        dp[i] = inf;
        for (int j = 1; j < i; 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;
}

int main()
{
    solve();
    return 0;
}
/**
6
3 8 7 1 6 6
0 -1 9 1 2 0
*/
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3073 ms 4112 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Execution timed out 3073 ms 4112 KB Time limit exceeded
7 Halted 0 ms 0 KB -