oj.uz

답안 #1066581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066581 2024-08-20T02:40:20 Z vjudge1 Building Bridges (CEOI17_building) C++14
0 / 100
 29 ms 3916 KB 
//    Tiger II H my beloved    //
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 16;
long long n, dp[N], h[N], w[N], k, sum = 0;
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<>> {
	static const ll inf = 1.0e18;
	double div(ll a, ll b) {
		return a / b; }
	bool isect(iterator x, iterator y) {
		if (y == end()) return x->p = inf, 0;
		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;
	}
};
LineContainer e;
int main () {
    ios_base::sync_with_stdio (0);
    cin.tie (0);
    cout.tie (0);

    cin>>n;
    for (int i = 1; i <= n; i ++)
    {
        cin>>h[i];
    }
    for (int i = 1; i <= n; i ++)
    {
        cin>>w[i];
    }
    dp[1] = -w[1];
    e.add (-2 * h[1], h[1] * h[1] + dp[1]);
    for (int i = 2; i <= n; i ++)
    {
        dp[i] = e.query (h[i]) + h[i] * h[i] - w[i];
        dp[i] = min (dp[i], dp[1] + (h[i] - h[1]) * (h[i] - h[1]) - w[i]);
        e.add (-2 * h[i], h[i] * h[i] + dp[i]);
    }
    for (int i = 1; i <= n; i ++)
    {
        sum += w[i];
    }
    cout<<dp[n] + sum;

    return 0;
}

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 3412 KB Output is correct
2 Incorrect 29 ms 3916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -