oj.uz

답안 #1013573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013573 2024-07-03T16:36:35 Z ByeWorld Building Bridges (CEOI17_building) C++14
30 / 100
 3000 ms 4424 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 2e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmn(int &a, int b){ a = min(a, b); }
int n;
int h[MAXN], w[MAXN], pr[MAXN], dp[MAXN];

signed main(){
    cin >> n;
    for(int i=1; i<=n; i++) cin >> h[i];
    for(int i=1; i<=n; i++){
        cin >> w[i]; pr[i] = pr[i-1]+w[i];
    }
    dp[1] = 0;
    for(int i=2; i<=n; i++){
        dp[i] = INF;
        for(int j=1; j<=i-1; j++){
            int te = dp[j] + pr[i-1]-pr[j] + (h[j]-h[i])*(h[j]-h[i]);
            chmn(dp[i], te);
        }
    }
    cout << dp[n] << '\n';
}
/*
6
3 8 7 1 6 6
0 -1 9 1 2 0
*/

Subtask #1
30.0 / 30.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 40.0

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