답안 #256411

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256411 2020-08-02T16:18:09 Z arbor Building Bridges (CEOI17_building) C++14
100 / 100
60 ms 10616 KB
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 1e5 + 5;

struct Line {
    mutable ll k, m, p;
    bool operator<(const Line& o) const { return k > o.k; }
    bool operator<(ll x) const { return p < x; }
};

struct LineContainer : multiset<Line, less<>> {
    // (for doubles, use inf = 1/.0, div(a,b) = a/b)
    const ll inf = LLONG_MAX;
    ll div(ll a, ll b) { // floored division
        return a / b - ((a ^ b) < 0 && a % b); }
    bool isect(iterator x, iterator y) {
        if (y == end()) { x->p = inf; return false; }
        if (x->k == y->k) x->p = x->m < y->m ? inf : -inf;
        else x->p = div(y->m - x->m, x->k - y->k);
        return x->p >= y->p;
    }
    void add(ll k, ll m) {
        auto z = insert({k, m, 0}), y = z++, x = y;
        while (isect(y, z)) z = erase(z);
        if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
        while ((y = x) != begin() && (--x)->p >= y->p)
            isect(x, erase(y));
    }
    ll query(ll x) {
        assert(!empty());
        auto l = *lower_bound(x);
        return l.k * x + l.m;
    }
} con;

int N; ll h[MN], w[MN];
ll ps[MN], dp[MN];

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    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];
    con.add(-2 * h[1], -ps[1] + h[1] * h[1]);
    for (int i = 2; i <= N; i++) {
        dp[i] = con.query(h[i]) + h[i] * h[i] + ps[i - 1];
        con.add(-2 * h[i], dp[i] - ps[i] + h[i] * h[i]);
    }
    cout << dp[N] << '\n';
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 3576 KB Output is correct
2 Correct 50 ms 4600 KB Output is correct
3 Correct 47 ms 4600 KB Output is correct
4 Correct 44 ms 4472 KB Output is correct
5 Correct 38 ms 5624 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 48 ms 3576 KB Output is correct
7 Correct 50 ms 4600 KB Output is correct
8 Correct 47 ms 4600 KB Output is correct
9 Correct 44 ms 4472 KB Output is correct
10 Correct 38 ms 5624 KB Output is correct
11 Correct 47 ms 4728 KB Output is correct
12 Correct 49 ms 4568 KB Output is correct
13 Correct 39 ms 4576 KB Output is correct
14 Correct 52 ms 4740 KB Output is correct
15 Correct 60 ms 10616 KB Output is correct
16 Correct 37 ms 5624 KB Output is correct
17 Correct 35 ms 4600 KB Output is correct
18 Correct 28 ms 4600 KB Output is correct