結果

問題 No.1998 Manhattan Restaurant
コンテスト
ユーザー tokusakurai
提出日時 2022-07-01 23:37:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 5,259 bytes
コンパイル時間 2,019 ms
コンパイル使用メモリ 200,200 KB
最終ジャッジ日時 2025-01-30 03:36:33
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 6 WA * 25
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

int main() {
    int N;
    cin >> N;

    vector<ll> a(N), b(N);

    rep(i, N) {
        ll x, y;
        cin >> x >> y;
        a[i] = x + y, b[i] = x - y;
    }

    ll L = -1, R = INT_MAX; // (l,R]
    ll la = *min_element(all(a)), ra = *max_element(all(a));
    ll lb = *min_element(all(b)), rb = *max_element(all(b));

    if (ra - la < rb - lb) swap(a, b), swap(la, lb), swap(ra, rb);
    // print(a), print(b);

    while (R - L > 1) {
        ll M = (L + R) / 2;
        if (ra - la <= 2 * M && rb - lb <= 2 * M) {
            R = M;
            continue;
        }
        bool flag = true;
        ll mi1 = INF, ma1 = -INF, mi2 = INF, ma2 = -INF;
        vector<ll> rem;
        rep(i, N) {
            if (a[i] <= la + M) {
                chmin(mi1, b[i]), chmax(ma1, b[i]);
            } else if (ra - M <= a[i]) {
                chmin(mi2, b[i]), chmax(ma2, b[i]);
            } else if (a[i] <= la + 2 * M && ra - 2 * M <= a[i]) {
                rem.eb(b[i]);
            } else if (a[i] <= la + 2 * M) {
                chmin(mi1, b[i]), chmax(ma1, b[i]);
            } else if (ra - 2 * M <= a[i]) {
                chmin(mi2, b[i]), chmax(ma2, b[i]);
            } else {
                flag = false;
            }
        }
        // cout << L << ' ' << M << ' ' << R << '\n';
        // cout << mi1 << ' ' << ma1 << ' ' << mi2 << ' ' << ma2 << '\n';
        // print(rem);
        if (!flag) {
            L = M;
            continue;
        }
        if (ma1 > mi1 + 2 * M || ma2 > mi2 + 2 * M) {
            L = M;
            continue;
        }
        if (empty(rem)) {
            R = M;
            continue;
        }
        ll mi = *min_element(all(rem)), ma = *max_element(all(rem));

        ll memi1 = mi1, mema1 = ma1, memi2 = mi2, mema2 = ma2;
        {
            chmin(mi1, mi);
            each(e, rem) {
                if (e <= mi1 + 2 * M) continue;
                chmin(mi2, e), chmax(ma2, e);
            }
            if (ma1 <= mi1 + 2 * M && ma2 <= mi2 + 2 * M) {
                R = M;
                continue;
            }
            mi1 = memi1, ma1 = mema1, mi2 = memi2, ma2 = mema2;
        }
        {
            chmin(mi2, mi);
            each(e, rem) {
                if (e <= mi2 + 2 * M) continue;
                chmin(mi1, e), chmax(ma1, e);
            }
            if (ma1 <= mi1 + 2 * M && ma2 <= mi2 + 2 * M) {
                R = M;
                continue;
            }
            mi1 = memi1, ma1 = mema1, mi2 = memi2, ma2 = mema2;
        }

        L = M;
    }

    cout << R << '\n';
}
0