Submission #1533194

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main(void) {
    int n;
    cin >> n;

    vector<ll> x(n), y(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
    }

    if (n == 1) {
        cout << 0 << endl;
        return 0;
    }
    
    ll maxr = max(x[1], x[0]), minr = min(x[1], x[0]);
    ll maxb = max(y[1], y[0]), minb = min(y[1], y[0]);
    if (abs(x[1] - x[0]) * abs(y[1] - y[0]) > abs(x[1] - y[0]) * abs(y[1] - x[0])) {
        maxr = max(x[1], y[0]), minr = min(x[1], y[0]);
        maxb = max(y[1], x[0]), minb = min(y[1], x[0]);
    }

    for (int i = 2; i < n; i++) {
        ll a = max(max(abs(x[i] - minr), abs(x[i] - maxr)), maxr - minr);
        ll b = max(max(abs(x[i] - minb), abs(x[i] - maxb)), maxb - minb);
        ll c = max(max(abs(y[i] - minr), abs(y[i] - maxr)), maxr - minr);
        ll d = max(max(abs(y[i] - minb), abs(y[i] - maxb)), maxb - minb);
        ll R = x[i], B = y[i];
        if (a * d > c * b) {
            R = y[i], B = x[i];
        }
        maxr = max(maxr, R);
        minr = min(minr, R);
        maxb = max(maxb, B);
        minb = min(minb, B);
    }

    cout << (maxr - minr) * (maxb - minb) << endl;

    return 0;
}

Submission Info

Judge Result