oj.uz

Submission #870788

# Submission time Handle Problem Language Result Execution time Memory
870788 2023-11-09T05:29:13 Z Turkhuu Building Bridges (CEOI17_building) C++17
100 / 100
 51 ms 9044 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll s(int x) {
    return (ll)x * x;
}
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)
	static 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()) 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;
	}
};
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    for (int &i : h) cin >> i;
    for (int &i : w) cin >> i;
    vector<ll> dp(n);
    dp[0] = -w[0];
    LineContainer a;
    a.add(2 * h[0], -1LL * h[0] * h[0] - dp[0]);
    for (int i = 1; i < n; i++) {
        a.add(2 * h[i], -1LL * h[i] * h[i] - (dp[i] = 1LL * h[i] * h[i] - w[i] - a.query(h[i])));
    }
    ll ans = dp[n - 1];
    for (int i : w) ans += i;
    cout << ans;
    return 6/22;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1884 KB Output is correct
2 Correct 30 ms 3088 KB Output is correct
3 Correct 30 ms 3064 KB Output is correct
4 Correct 31 ms 2904 KB Output is correct
5 Correct 26 ms 3928 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 30 ms 1884 KB Output is correct
7 Correct 30 ms 3088 KB Output is correct
8 Correct 30 ms 3064 KB Output is correct
9 Correct 31 ms 2904 KB Output is correct
10 Correct 26 ms 3928 KB Output is correct
11 Correct 29 ms 3164 KB Output is correct
12 Correct 30 ms 3028 KB Output is correct
13 Correct 24 ms 2904 KB Output is correct
14 Correct 30 ms 3164 KB Output is correct
15 Correct 51 ms 9044 KB Output is correct
16 Correct 26 ms 4168 KB Output is correct
17 Correct 16 ms 2908 KB Output is correct
18 Correct 16 ms 2908 KB Output is correct