oj.uz

Submission #592854

# Submission time Handle Problem Language Result Execution time Memory
592854 2022-07-09T16:54:50 Z VasLemmy Building Bridges (CEOI17_building) C++17
100 / 100
 65 ms 9876 KB 
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
 
const int mxN = 1e6 + 5, mod = 1e9 + 7, LOG = 20;
 
int n, h[mxN], w[mxN];
 
ll p[mxN], dp[mxN];
 
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 = LLONG_MAX;
	ll div(ll a, ll b) { 
		return a / b - ((a ^ b) < 0 && 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 line;
 
int main() {
	ios :: sync_with_stdio(false), cin.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> h[i];
	for (int i = 1; i <= n; ++i) cin >> w[i], p[i] = p[i - 1] + w[i];
	line.add(2 * h[1], -(h[1] * 1ll * h[1] - p[1]));
	for (int i = 2; i <= n; ++i) {
		dp[i] = h[i] * 1ll * h[i] + p[i - 1] + (-line.query(h[i]));
		line.add(2 * h[i], -(h[i] * 1ll * h[i] - p[i] + dp[i]));
	} 
	cout << dp[n];
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3676 KB Output is correct
2 Correct 38 ms 3788 KB Output is correct
3 Correct 40 ms 3732 KB Output is correct
4 Correct 33 ms 3560 KB Output is correct
5 Correct 44 ms 4736 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 37 ms 3676 KB Output is correct
7 Correct 38 ms 3788 KB Output is correct
8 Correct 40 ms 3732 KB Output is correct
9 Correct 33 ms 3560 KB Output is correct
10 Correct 44 ms 4736 KB Output is correct
11 Correct 39 ms 3824 KB Output is correct
12 Correct 51 ms 3784 KB Output is correct
13 Correct 34 ms 3724 KB Output is correct
14 Correct 41 ms 3844 KB Output is correct
15 Correct 65 ms 9876 KB Output is correct
16 Correct 34 ms 4752 KB Output is correct
17 Correct 21 ms 3720 KB Output is correct
18 Correct 35 ms 3760 KB Output is correct