oj.uz

답안 #928658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928658 2024-02-17T01:03:45 Z Regulus Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 4444 KB 
#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 1e5+5;
const ll LLINF = 2e18;
ll h[N], w[N], dp[N], sum[N];

int main(void)
{ IO
    int n, i;

    cin >> n;
    for (i=1; i <= n; ++i) cin >> h[i];
    for (i=1; i <= n; ++i) cin >> w[i], sum[i] = sum[i-1] + w[i];

    for (i=1; i <= n; ++i) dp[i] = LLINF;
    dp[1] = 0;
    for (i=2; i <= n; ++i)
    {
        for (int j=i-1; j >= 1; --j)
        {
            ll tmp = dp[j] + (h[i]-h[j])*(h[i]-h[j]) + sum[i-1]-sum[j];
            dp[i] = min(dp[i], tmp);
        }
    }

    cout << dp[n] << '\n';


    return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2524 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2524 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Execution timed out 3037 ms 4444 KB Time limit exceeded
7 Halted 0 ms 0 KB -