oj.uz

답안 #988364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988364 2024-05-24T14:41:29 Z VMaksimoski008 Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 4428 KB 
#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int32_t main() {
    int n;
    cin >> n;

    vector<ll> h(n+1), w(n+1), pref(n+1);
    for(int i=1; i<=n; i++) cin >> h[i];
    for(int i=1; i<=n; i++) cin >> w[i];
    for(int i=1; i<=n; i++) pref[i] = pref[i-1] + w[i];

    vector<ll> dp(n+1, 1e18);
    dp[1] = 0;

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

    cout << dp[n] << '\n';
    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 472 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 472 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Execution timed out 3013 ms 4428 KB Time limit exceeded
7 Halted 0 ms 0 KB -