oj.uz

답안 #270558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
270558 2020-08-17T18:11:58 Z MarcoMeijer Building Bridges (CEOI17_building) C++14
100 / 100
 94 ms 66536 KB 
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

//===================//
//  Added libraries  //
//===================//

// geometry
typedef complex<ll> point;
#define x real
#define y imag

ll dot(point a, point b) {
    return (conj(a) * b).x();
}

ll f(point a, ll x) {
    return dot(a, {x, 1});
}

//===================//
//end added libraries//
//===================//

void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}


//===================//
//   begin program   //
//===================//

const int MX = 1e6+10;

int n;
ll h[MX], w[MX];
ll dp[MX];

point SEG[MX*4];

void addLine(point v, int p=0, int l=0, int r=MX) {
    int m = (l+r)/2;
    bool lef = f(v, l) < f(SEG[p], l);
    bool mid = f(v, m) < f(SEG[p], m);
    if(mid) swap(SEG[p], v);
    if(l+1 == r) return;
    if(lef != mid) {
        addLine(v, p*2+1, l, m);
    } else {
        addLine(v, p*2+2, m, r);
    }
}
ll get(int x, int p=0, int l=0, int r=MX) {
    int m = (l+r)/2;
    if(l+1 == r) {
        return f(SEG[p], x);
    } else if(x < m) {
        return min(f(SEG[p], x), get(x, 2*p+1, l, m));
    } else {
        return min(f(SEG[p], x), get(x, 2*p+2, m, r));
    }
}

void program() {
    IN(n);
    RE(i,n) IN(h[i]);
    RE(i,n) IN(w[i]);

    ll totW = 0;
    RE(i,n) totW += w[i];

    RE(i,MX*4) SEG[i] = point(0,INF);

    dp[0] = -w[0];
    addLine(point(-2*h[0], dp[0] + h[0]*h[0]));

    REP(i,1,n) {
        dp[i] = get(h[i]) + h[i]*h[i] - w[i];
        addLine(point(-2*h[i], dp[i] + h[i]*h[i]));
    }

    ll ans = dp[n-1] + totW;
    OUTL(ans);
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62968 KB Output is correct
2 Correct 34 ms 62976 KB Output is correct
3 Correct 35 ms 62976 KB Output is correct
4 Correct 35 ms 62976 KB Output is correct
5 Correct 36 ms 62952 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 65272 KB Output is correct
2 Correct 82 ms 65404 KB Output is correct
3 Correct 81 ms 65272 KB Output is correct
4 Correct 78 ms 65272 KB Output is correct
5 Correct 75 ms 65272 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 62968 KB Output is correct
2 Correct 34 ms 62976 KB Output is correct
3 Correct 35 ms 62976 KB Output is correct
4 Correct 35 ms 62976 KB Output is correct
5 Correct 36 ms 62952 KB Output is correct
6 Correct 84 ms 65272 KB Output is correct
7 Correct 82 ms 65404 KB Output is correct
8 Correct 81 ms 65272 KB Output is correct
9 Correct 78 ms 65272 KB Output is correct
10 Correct 75 ms 65272 KB Output is correct
11 Correct 94 ms 65272 KB Output is correct
12 Correct 93 ms 66360 KB Output is correct
13 Correct 79 ms 66424 KB Output is correct
14 Correct 92 ms 66536 KB Output is correct
15 Correct 77 ms 66296 KB Output is correct
16 Correct 74 ms 66296 KB Output is correct
17 Correct 71 ms 66424 KB Output is correct
18 Correct 73 ms 66424 KB Output is correct