Submission #939170

#	Time	Username	Problem	Language	Result	Execution time	Memory
939170		vjudge1	Art Exhibition (JOI18_art)	C++17	100 / 100	263 ms	51540 KiB

art

#include<bits/stdc++.h>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mispertion ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define F first
#define S second
#define getlast(s) (*s.rbegin())
#define debg cout << "OK\n"

const ld PI = 3.1415926535;
const int N = 500000+1;
const int M = 7e6 + 1;
int mod = 998244353;
const int infi = INT_MAX;
const ll infl = LLONG_MAX;
const int P = 31;

int mult(int a, int b) {
    return a * 1LL * b % mod;
}

int sum(int a, int b) { 
    if (a + b < 0)
        return a + b + mod;
    if (a + b >= mod)
        return a + b - mod;
    return a + b;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1) {
        return binpow(a, n - 1) * a % mod;
    } else {
        ll b = binpow(a, n / 2);
        return b * b % mod;
    }
}

int a[N], b[N], n, pr[N];
vector<pii> v;

void solve(){
    cin >> n;
    v.resize(n);
    for(int i = 1; i <= n; i++){
        int x, y;
        cin >> x >> y;
        v[i - 1] = {x, y};
    }
    sort(all(v));
    for(int i = 0; i < n; i++)
        a[i + 1] = v[i].F, b[i + 1] = v[i].S;
    for(int i = 1; i <= n; i++)
        pr[i] = pr[i - 1] + b[i];
    set<pii> st;
    int ans = 0;
    for(int i = 1; i <= n; i++){
        st.insert({-pr[i - 1] + a[i], i});
        int ps = st.rbegin()->S;
        ans = max(ans, a[ps] - a[i] + pr[i] - pr[ps - 1]);
    }
    cout << ans << '\n';
}   

signed main() {
    mispertion;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

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