#1192729 (C++17) No.3759 Watch Fireworks

• 問題: No.3759 Watch Fireworks
• ユーザー: ococonomy1
• 提出日時: 2026-10-10 09:45:16
• 言語: C++17 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 465 ms / 2,000 ms
• コード長: 4,831 bytes
• コンパイル時間: 1,470 ms
• コンパイル使用メモリ: 230,364 KB
• 実行使用メモリ: 24,816 KB
• 最終ジャッジ日時: 2026-10-10 09:45:28
• 合計ジャッジ時間: 6,876 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge4_0

ファイルパターン	結果
sample	AC * 3
other	AC * 47

ソースコード

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
#define MOD 998244353
//#define MOD 1000000007
#define el '\n'
#define El '\n'
#define YESNO(x) ((x) ? "Yes" : "No")
#define YES YESNO(true)
#define NO YESNO(false)
#define EXIT_ANS(x) {cout << (x) << '\n'; return;}
template <typename T> void inline SORT(T &v){sort(v.begin(),v.end()); return;}
template <typename T> void inline REV(T &v){reverse(v.begin(),v.end()); return;}
template <typename T> void inline VEC_UNIQ(T &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); return;}
template <typename T> auto inline MAX(T &v){return *max_element(v.begin(),v.end());}
template <typename T> auto inline MIN(T &v){return *min_element(v.begin(),v.end());}
template <typename T> auto inline SUM(vector<T> &v){T ans = 0; for(int i = 0; i < (int)v.size(); i++)ans += v[i]; return ans;}
template <typename T> void inline DEC(T &v){for(int i = 0; i < (int)v.size(); i++)v[i]--; return;}
template <typename T> void inline INC(T &v){for(int i = 0; i < (int)v.size(); i++)v[i]++; return;}
void inline TEST(void){cerr << "TEST" << endl; return;}
template <typename T,typename S> bool inline chmin(T &x,S y){
    if(x > (T)y){
        x = (T)y;
        return true;
    }
    return false;
}
template <typename T,typename S> bool inline chmax(T &x,S y){
    if(x < (T)y){
        x = (T)y;
        return true;
    }
    return false;
}
template <typename T = long long> vector<T> inline get_vec(int n){
    vector<T> ans(n);
    for(int i = 0; i < n; i++)cin >> ans[i];
    return ans;
}
template <typename T> void inline print_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cout << vec[i];
        if(kaigyou || i == n - 1)cout << '\n';
        else cout << ' ';
    }
    if(!n)cout << '\n';
    return;
}
template <typename T> void inline debug_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cerr << vec[i];
        if(kaigyou || i == n - 1)cerr << '\n';
        else cerr << ' ';
    }
    if(!n)cerr << '\n';
    return;
}
vector<vector<int>> inline get_graph(int n,int m = -1,bool direct = false,bool decrement = true){
    if(m == -1)m = n - 1;
    vector<vector<int>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        if(decrement)u--,v--;
        g[u].push_back(v);
        if(!direct)g[v].push_back(u);
    }
    return g;
}
template <typename T> vector<vector<pair<T,int>>> inline get_weighted_graph(int n,int m = -1,bool direct = false,bool decrement = true){
    if(m == -1)m = n - 1;
    vector<vector<pair<T,int>>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        if(decrement)u--,v--;
        ll w; cin >> w;
        g[u].push_back(pair(w,v));
        if(!direct)g[v].push_back(pair(w,u));
    }
    return g;
}

#define MULTI_TEST_CASE false
void solve(void){
    //問題を見たらまず「この問題設定から言えること」をいっぱい言う
    //よりシンプルな問題に言い換えられたら、言い換えた先の問題を自然言語ではっきりと書く
    //複数の解法のアイデアを思いついた時は全部メモしておく
    //g++ -D_GLIBCXX_DEBUG -Wall -O2 c.cpp -o o
    int n;
    cin >> n;
    vector<ll> x(n),y(n);
    vector<pll> xy(n);
    for(int i = 0; i < n; i++){
        ll s,t;
        cin >> s >> t;
        x[i] = 2 * (s + t);
        y[i] = 2 * (s - t);
        xy[i] = pair(x[i],y[i]);
    }
    VEC_UNIQ(xy);
    if(xy.size() <= 2)EXIT_ANS(0);
    ll xmin = MIN(x),xmax = MAX(x),ymin = MIN(y),ymax = MAX(y);
    ll ok = max(xmax - xmin,ymax - ymin) / 2 + 1,ng = 0;
    while(ok - ng >= 2){
        ll mid = (ok + ng) / 2;
        bool flag = false;
        for(int S = 0; S < 4; S++){
            ll cx = xmin + mid,cy = ymin + mid;
            if(S & 1)cx = xmax - mid;
            if(S & 2)cy = ymax - mid;
            vector<ll> vx,vy;
            for(int i = 0; i < n; i++){
                if(max(abs(x[i] - cx),abs(y[i] - cy)) > mid){
                    vx.push_back(x[i]);
                    vy.push_back(y[i]);
                }
            }
            if(vx.empty() || max(MAX(vx) - MIN(vx),MAX(vy) - MIN(vy)) <= 2 * mid){
                flag = true;
                break;
            }
        }
        if(flag)ok = mid;
        else ng = mid;
    }
    cout << ok  << el;
    return;
}

void calc(void){
    return;
}

signed main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE)cin >> t;
    while(t--){
        solve();
    }
    return 0;
}