답안 #159257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
159257 2019-10-21T16:23:12 Z nvmdava Building Bridges (CEOI17_building) C++17
30 / 100
3000 ms 2620 KB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define N 100005
#define INF 0x3f3f3f3f3f3f3f3f

ll dp[N], h[N], p[N];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin>>n;

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

    for(int i = 2; i <= n; i++){
        dp[i] = 0x3f3f3f3f3f3f3f3f;
        for(int j = 1; j < i; j++){
            dp[i] = min(dp[i], dp[j] + p[i - 1] - p[j] + (h[i] - h[j]) * (h[i] - h[j]));
        }
    }
    cout<<dp[n];
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3029 ms 2620 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Execution timed out 3029 ms 2620 KB Time limit exceeded
7 Halted 0 ms 0 KB -