제출 #349744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349744		spike1236	Art Exhibition (JOI18_art)	C++14	10 / 100	6 ms	512 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>


const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 2e5 + 10;
int n;
ll a[MAXN], b[MAXN];
int ord[MAXN];

bool cmp(int i, int j) {
    return (b[i] - 2 * a[i] < b[j] - 2 * a[j]);
}

ll get_n16() {
    ll ans = -1e18;
    for(int mask = 1; mask < (1 << n); ++mask) {
        ll s = 0;
        ll mx = -1e18, mn = 1e18;
        for(int i = 0; i < n; ++i) {
            if((mask >> i) & 1) {
                s += b[i + 1];
                mx = max(mx, a[i + 1]);
                mn = min(mn, a[i + 1]);
            }
        }
        ans = max(ans, s - (mx - mn));
    }
    return ans;
}

void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i] >> b[i];
    ll ans = -1e18;
    if(n <= 16) ans = get_n16();
    for(int i = 1; i <= n; ++i)
        ord[i] = i;
    sort(ord + 1, ord + n + 1, &cmp);
    ll s = 0;
    ll mn = 1e18, mx = -1e18;
    for(int i = n; i > 0; --i) {
        mn = min(mn, a[ord[i]]);
        mx = max(mx, a[ord[i]]);
        s += b[ord[i]];
        ans = max(ans, s - (mx - mn));
    }
    s = 0;
    mn = 1e18, mx = -1e18;
    for(int i = 1; i <= n; ++i) {
        mn = min(mn, a[ord[i]]);
        mx = max(mx, a[ord[i]]);
        s += b[ord[i]];
        ans = max(ans, s - (mx - mn));
    }
    cout << ans;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    ///cin >> T;
    while(T--) solve(), cout << '\n';
    return 0;
}

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