Submission #471073

#	Time	Username	Problem	Language	Result	Execution time	Memory
471073		jalsol	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	204 KiB

art

// looking to shine brighter in this world...

#define TASK "art"

#ifdef LOCAL
#include "local.h"
#else
#include <bits/stdc++.h>
#define debug(...)
#define DB(...)
#endif

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
#define Fe(...) for (auto __VA_ARGS__)

template <class C> inline int isz(const C& c) { return static_cast<int>(c.size()); }
template <class T> inline bool chmin(T& a, const T& b) { return (a > b) ? a = b, true : false; }
template <class T> inline bool chmax(T& a, const T& b) { return (a < b) ? a = b, true : false; }

const bool __initialization = []() {
    cin.tie(nullptr)->sync_with_stdio(false);
    if (fopen(TASK".inp", "r")) {
        (void)(!freopen(TASK".inp", "r", stdin));
        (void)(!freopen(TASK".out", "w", stdout)); }
    cout << setprecision(12) << fixed;
    return true;
}();

constexpr ld eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;

// ================================================================================

constexpr int maxn = 5e5 + 5;

#include <vector>
#include <climits>

struct Tree {
    using T = ll;
    static constexpr T unit = linf;

    T f(T a, T b) {
        return std::min(a, b);
    }

    std::vector<T> s; int n;
    Tree(int n = 0, T def = unit) : s(2 * n, def), n(n) {}

    void update(int pos, T val) {
        for (s[pos += n] = val; pos >>= 1;) {
            s[pos] = f(s[pos << 1], s[pos << 1 | 1]);
        }
    }

    T query(int b, int e) {
        T ra = unit, rb = unit;
        for (b += n, e += n; b < e; b >>= 1, e >>= 1) {
            if (b & 1) ra = f(ra, s[b++]);
            if (e & 1) rb = f(s[--e], rb);
        }
        return f(ra, rb);
    }
};

int n;
pair<ll, int> a[maxn];
ll pref[maxn];

signed main() {
    cin >> n;
    For (i, 1, n) cin >> a[i].first >> a[i].second;

    sort(a + 1, a + n + 1);

    For (i, 1, n) {
        pref[i] = pref[i - 1] + a[i].second;
    }

    // bi + ... + bj - aj + ai
    // pref[j] - pref[i - 1] - aj + ai
    // (pref[j] - a[j]) - (pref[i - 1] - ai)

    ll ans = 0;
    Tree tree(n + 5);

    For (i, 1, n) {
        ll temp = (pref[i] - a[i].first) - tree.query(1, i);
        chmax(ans, temp);
        tree.update(i, pref[i - 1] - a[i].first);
    }

    cout << ans << '\n';

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50