Submission #880398

#	Time	Username	Problem	Language	Result	Execution time	Memory
880398		_KuroNeko_	Art Exhibition (JOI18_art)	C++17	100 / 100	146 ms	26188 KiB

art

#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vdb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<string> vs;
typedef set<int> si;
typedef set<long long> sl;
typedef set<double> sdb;
typedef set<string> ss;
typedef set<char> sc;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define ftb(i, a, b) for (int i = a, _b = b; i <= _b; ++i)
#define ft(i, a, b) for (int i = a, _b = b; i < _b; ++i)
#define fgb(i, a, b) for (int i = a, _b = b; i >= _b; --i)
#define fg(i, a, b) for (int i = a, _b = b; i > _b; --i)
#define endl "\n"
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    vector<pll> a(n + 1,{0,0});
    ftb(i, 1, n) {
        cin >> a[i].first >> a[i].second;
    }
    sort(a.begin(), a.end());
    vl prefix_sum(n + 1, 0);
    ftb(i, 1, n) {
        prefix_sum[i] = prefix_sum[i - 1] + a[i].second;
    }
    vl d(n + 1, 0);
    d[n] = prefix_sum[n] - a[n].first;
    fgb(i, n - 1, 0) {
        d[i] = max(d[i + 1], prefix_sum[i] - a[i].first);
    }
    ll ans = 0;
    ftb(i, 1, n) {
        ans = max(ans, d[i] - prefix_sum[i - 1] + a[i].first);
    }
    cout << ans << endl;
}

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