oj.uz

답안 #426614

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426614 2021-06-14T07:54:08 Z oleh1421 Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 3496 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=100010;
const ll mod=1000000007;
const ll inf=1e15;
ll h[N],w[N];
ll dp[N];
ll a[N],b[N];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;cin>>n;
    for (int i=1;i<=n;i++) cin>>h[i];
    for (int i=1;i<=n;i++) cin>>w[i],w[i]+=w[i-1];
    dp[1]=0;
    a[1]=h[1]*h[1]-w[1]+dp[1];
    b[1]=-2*h[1];
    for (int i=2;i<=n;i++){
        dp[i]=inf;
        for (int j=1;j<i;j++){
            dp[i]=min(dp[i],a[j]+b[j]*h[i]);
        }
        dp[i]+=h[i]*h[i]+w[i-1];
        a[i]=h[i]*h[i]+dp[i]-w[i];
        b[i]=-2*h[i];
    }
    cout<<dp[n]<<endl;
    return 0;
}
/**
6
3 8 7 1 6 6
0 -1 9 1 2 0
**/

Subtask #1
30.0 / 30.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

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