結果

問題 No.2612 Close the Distance
ユーザー noya2
提出日時 2025-03-05 01:00:53
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 283 ms / 3,000 ms
コード長 6,442 bytes
コンパイル時間 3,877 ms
コンパイル使用メモリ 283,788 KB
実行使用メモリ 9,472 KB
最終ジャッジ日時 2025-03-05 01:01:05
合計ジャッジ時間 11,646 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

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

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

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

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n; in(n);
    vector<ll> xs(n), ys(n);
    rep(i,n){
        in(xs[i],ys[i]);
        xs[i] *= 2;
        ys[i] *= 2;
    }
    vector<ll> xsp(n), ysp(n);
    auto check3 = [&](int sz, ll d) -> bool {
        ll xpyma = -linf, xpymi = linf;
        ll xmyma = -linf, xmymi = linf;
        rep(i,sz){
            chmax(xpyma,xsp[i]+ysp[i]);
            chmin(xpymi,xsp[i]+ysp[i]);
            chmax(xmyma,xsp[i]-ysp[i]);
            chmin(xmymi,xsp[i]-ysp[i]);
        }
        ll cxma = (xpyma + xmyma)/2 - d;
        ll cyma = (xpyma - xmyma)/2;
        ll cxmi = (xpymi + xmymi)/2 + d;
        ll cymi = (xpymi - xmymi)/2;
        rep(i,sz){
            if (abs(xsp[i] - cxma) + abs(ysp[i] - cyma) <= d){
                continue;
            }
            if (abs(xsp[i] - cxmi) + abs(ysp[i] - cymi) <= d){
                continue;
            }
            return false;
        }
        return true;
    };
    auto check2 = [&](int sz, ll d) -> bool {
        if (check3(sz,d)) return true;
        rep(i,sz){
            swap(xsp[i],ysp[i]);
        }
        return check3(sz,d);
    };
    auto check1 = [&](ll d) -> bool {
        ll xpy = -linf, xmy = -linf;
        rep(i,n){
            chmax(xpy,xs[i]+ys[i]);
            chmax(xmy,xs[i]-ys[i]);
        }
        ll cx = (xpy + xmy)/2 - d;
        ll cy = (xpy - xmy)/2;
        int sz = 0;
        rep(i,n){
            if (abs(xs[i] - cx) + abs(ys[i] - cy) <= d){
                continue;
            }
            xsp[sz] = xs[i];
            ysp[sz] = ys[i];
            sz++;
        }
        return check2(sz,d);
    };
    auto check = [&](ll d) -> bool {
        rep(tt,4){
            if (check1(d)) return true;
            rep(i,n){
                swap(xs[i],ys[i]);
                xs[i] = -xs[i];
            }
        }
        return false;
    };
    ll le = -1, ri = linf;
    while (ri - le > 1){
        ll md = (le + ri) / 2;
        if (check(md)){
            ri = md;
        }
        else {
            le = md;
        }
    }
    out(ri);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0