oj.uz

답안 #507581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
507581 2022-01-12T18:37:38 Z Lobo Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 4416 KB 
#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 110000

int n, h[maxn], w[maxn], ps[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];
        ps[i] = ps[i-1] + w[i];
    }

    dp[n] = 0;
    for(int i = n-1; i >= 1; i--) {
        dp[i] = inf;
        for(int j = i+1; j <= n; j++) {
            dp[i] = min(dp[i], dp[j] + (h[j]-h[i])*(h[j]-h[i]) + ps[j-1] - ps[i]);
        }
    }

    cout << dp[1] << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Execution timed out 3047 ms 4416 KB Time limit exceeded
7 Halted 0 ms 0 KB -