oj.uz

답안 #777403

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777403 2023-07-09T08:01:25 Z horiiseun Building Bridges (CEOI17_building) C++17
100 / 100
 43 ms 7332 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

struct Line {
    ll m, c;

    ll calc(ll x) {
        return m * x + c;
    }
};

struct LCT {
    int lf, rh;
    Line l;
    LCT *lft, *rht;

    LCT(Line tl, int tlf, int trh): lf(tlf), rh(trh), l(tl), lft(NULL), rht(NULL) {};
};

void addLine(LCT *x, Line nl) {
    int md = (x->lf + x->rh) / 2;
    if (nl.calc(md) < x->l.calc(md)) swap(x->l, nl);
    if (x->lf + 1 == x->rh) return;
    if (x->l.calc(x->lf) > nl.calc(x->lf)) {
        if (!x->lft) {
            x->lft = new LCT(nl, x->lf, md);
        } else {
            addLine(x->lft, nl);
        }
    } else if (x->l.calc(x->rh - 1) > nl.calc(x->rh - 1)) {
        if (!x->rht) {
            x->rht = new LCT(nl, md, x->rh);
        } else {
            addLine(x->rht, nl);
        }
    }
}

ll query(LCT *x, ll v) {
    int md = (x->lf + x->rh) / 2;
    ll ret = x->l.calc(v);
    if (v < md && x->lft) {
        ret = min(ret, query(x->lft, v));
    }
    if (v >= md && x->rht) {
        ret = min(ret, query(x->rht, v));
    }
    return ret;
}

int n;
vector<ll> h, pref;
ll dp;
LCT *lc;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    h.resize(n + 1, 0);
    pref.resize(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> h[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> pref[i];
        pref[i] += pref[i - 1];
    }

    lc = new LCT({-2 * h[1], h[1] * h[1] - pref[1]}, 0, 1e9 + 5);
    for (int i = 2; i <= n; i++) {
        dp = query(lc, h[i]) + h[i] * h[i] + pref[i - 1];
        addLine(lc, {-2 * h[i], h[i] * h[i] + dp - pref[i]});
    }

    cout << dp << "\n";

}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 3156 KB Output is correct
2 Correct 39 ms 3236 KB Output is correct
3 Correct 39 ms 3148 KB Output is correct
4 Correct 43 ms 2912 KB Output is correct
5 Correct 27 ms 4436 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 39 ms 3156 KB Output is correct
7 Correct 39 ms 3236 KB Output is correct
8 Correct 39 ms 3148 KB Output is correct
9 Correct 43 ms 2912 KB Output is correct
10 Correct 27 ms 4436 KB Output is correct
11 Correct 37 ms 3224 KB Output is correct
12 Correct 38 ms 3152 KB Output is correct
13 Correct 33 ms 2900 KB Output is correct
14 Correct 37 ms 3276 KB Output is correct
15 Correct 30 ms 7332 KB Output is correct
16 Correct 30 ms 4468 KB Output is correct
17 Correct 13 ms 2916 KB Output is correct
18 Correct 12 ms 2920 KB Output is correct